imc also accepts pre-converted input, in which case it skips it's
            conversion.
         </p>
         <p>Let's demonstrate how this works by calling Dijkstra's algorithm to compute the shortest paths between all vertices in the
            graph.  The Floyd Warshall algorithm computes these same quantities more efficiently, but that would just be one more algorithm
            to implement and maintain.
         </p>
         <p>Load and convert the graph.</p><pre class="codeinput">load_gaimc_gra