static void Main(string[] args) { GraphMx <int> G = createTestGraph(); Debug.WriteLine("Node Count: " + G.nodeCount); Debug.WriteLine("Edge Count: " + G.edgeCount); Debug.WriteLine(G.ToString()); List <NodeMx <int> >[] paths; double[] shortestPaths = DijkstraShortestPath(G, 5, out paths); int a = 4; }