// public DepthFirstSearch(Graph G) { this.G = G; NumEdges = G.MaxEdges; NumVertexes = G.MaxVertexes; Visited = new HashSet<int>(); }
private static void ConnectNodes(Graph G) { G.Connect(0, 1); G.Connect(0, 5); G.Connect(1, 4); G.Connect(4, 8); G.Connect(5, 8); G.Connect(6, 9); G.Connect(5, 10); G.Connect(1, 2); G.Connect(6,3); G.Connect(7, 6); G.Connect(2, 3); G.Connect(7, 3); G.Connect(6, 11); G.Connect(7, 11); }
private static Graph CreateGraph() { Graph G = new Graph(14, 12); ConnectNodes(G); return G; }