You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[Graph.h](ch4/head/Graph.h)| undirected graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[GraphGenerator.java](https://algs4.cs.princeton.edu/41graph/GraphGenerator.java.html)| generate random graphs |
70
-
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[DepthFirstSearch.h](ch4/head/DepthFirstSearch.h)| depth-first search in a graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[NonrecursiveDFS.h](ch4/head/NonrecursiveDFS.h)| DFS in a graph (nonrecursive) |
71
-
|[4.1](https://algs4.cs.princeton.edu/41graph/index.php#4.1)|[DepthFirstPaths.h](ch4/head/DepthFirstPaths.h)| paths in a graph (DFS) |[4.2](https://algs4.cs.princeton.edu/41graph/index.php#4.2)|[BreadthFirstPaths.h](ch4/head/BreadthFirstPaths.h)| paths in a graph (BFS) |
72
-
|[4.3](https://algs4.cs.princeton.edu/41graph/index.php#4.3)|[CC.h](ch4/head/CC.h)| connected components of a graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[Bipartite.h](ch4/head/Bipartite.h)| bipartite or odd cycle (DFS) |
73
-
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[BipartiteX.h](ch4/head/BipartiteX.h)| bipartite or odd cycle (BFS) |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[Cycle.h](ch4/head/Cycle.h)| cycle in a graph |
74
-
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[EulerianCycle.h](ch4/head/EulerianCycle.h)| Eulerian cycle in a graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[EulerianPath.h](ch4/head/EulerianPath.h)| Eulerian path in a graph |
75
-
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[SymbolGraph.h](ch4/head/SymbolGraph.h)| symbol graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[DegreesOfSeparation.cpp](ch4/14_DegreesOfSeparation/main.cpp)| degrees of separation |
76
-
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[Digraph.h](ch4/head/Digraph.h)| directed graph |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DigraphGenerator.h](ch4/head/DigraphGenerator.h)| generate random digraphs |
77
-
|[4.4](https://algs4.cs.princeton.edu/42digraph/index.php#4.4)|[DirectedDFS.h](ch4/head/DirectedDFS.h)| depth-first search in a digraph |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[NonrecursiveDirectedDFS.h](ch4/head/NonrecursiveDirectedDFS.h)| DFS in a digraph (nonrecursive) |
78
-
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DepthFirstDirectedPaths.h](ch4/head/DepthFirstDirectedPaths.h)| paths in a digraph (DFS) |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[BreadthFirstDirectedPaths.h](ch4/head/BreadthFirstDirectedPaths.h)| paths in a digraph (BFS) |
79
-
|[-](https://algs4.cs.princeton.edu/44sp/index.php#-)|[DirectedCycle.h](ch4/head/DirectedCycle.h)| cycle in a digraph |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DirectedCycleX.h](ch4/head/DirectedCycleX.h)| cycle in a digraph (nonrecursive) |
80
-
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DirectedEulerianCycle.h](ch4/head/DirectedEulerianCycle.h)| Eulerian cycle in a digraph |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DirectedEulerianPath.h](ch4/head/DirectedEulerianPath.h)| Eulerian path in a digraph |
81
-
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DepthFirstOrder.h](ch4/head/DepthFirstOrder.h)| depth-first order in a digraph |[4.5](https://algs4.cs.princeton.edu/42digraph/index.php#4.5)|[Topological.h](ch4/head/Topological.h)| topological order in a DAG |
69
+
| REF | PROGRAM | DESCRIPTION / C++DOC | REF | PROGRAM | DESCRIPTION / C++DOC |
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[Graph.h](ch4/head/Graph.h)| undirected graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[GraphGenerator.java](https://algs4.cs.princeton.edu/41graph/GraphGenerator.java.html)| generate random graphs |
72
+
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[DepthFirstSearch.h](ch4/head/DepthFirstSearch.h)| depth-first search in a graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[NonrecursiveDFS.h](ch4/head/NonrecursiveDFS.h)| DFS in a graph (nonrecursive) |
73
+
|[4.1](https://algs4.cs.princeton.edu/41graph/index.php#4.1)|[DepthFirstPaths.h](ch4/head/DepthFirstPaths.h)| paths in a graph (DFS) |[4.2](https://algs4.cs.princeton.edu/41graph/index.php#4.2)|[BreadthFirstPaths.h](ch4/head/BreadthFirstPaths.h)| paths in a graph (BFS) |
74
+
|[4.3](https://algs4.cs.princeton.edu/41graph/index.php#4.3)|[CC.h](ch4/head/CC.h)| connected components of a graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[Bipartite.h](ch4/head/Bipartite.h)| bipartite or odd cycle (DFS) |
75
+
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[BipartiteX.h](ch4/head/BipartiteX.h)| bipartite or odd cycle (BFS) |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[Cycle.h](ch4/head/Cycle.h)| cycle in a graph |
76
+
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[EulerianCycle.h](ch4/head/EulerianCycle.h)| Eulerian cycle in a graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[EulerianPath.h](ch4/head/EulerianPath.h)| Eulerian path in a graph |
77
+
|[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[SymbolGraph.h](ch4/head/SymbolGraph.h)| symbol graph |[-](https://algs4.cs.princeton.edu/41graph/index.php#-)|[DegreesOfSeparation.cpp](ch4/14_DegreesOfSeparation/main.cpp)| degrees of separation |
78
+
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[Digraph.h](ch4/head/Digraph.h)| directed graph |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DigraphGenerator.h](ch4/head/DigraphGenerator.h)| generate random digraphs |
79
+
|[4.4](https://algs4.cs.princeton.edu/42digraph/index.php#4.4)|[DirectedDFS.h](ch4/head/DirectedDFS.h)| depth-first search in a digraph |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[NonrecursiveDirectedDFS.h](ch4/head/NonrecursiveDirectedDFS.h)| DFS in a digraph (nonrecursive) |
80
+
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DepthFirstDirectedPaths.h](ch4/head/DepthFirstDirectedPaths.h)| paths in a digraph (DFS) |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[BreadthFirstDirectedPaths.h](ch4/head/BreadthFirstDirectedPaths.h)| paths in a digraph (BFS) |
81
+
|[-](https://algs4.cs.princeton.edu/44sp/index.php#-)|[DirectedCycle.h](ch4/head/DirectedCycle.h)| cycle in a digraph |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DirectedCycleX.h](ch4/head/DirectedCycleX.h)| cycle in a digraph (nonrecursive) |
82
+
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DirectedEulerianCycle.h](ch4/head/DirectedEulerianCycle.h)| Eulerian cycle in a digraph |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DirectedEulerianPath.h](ch4/head/DirectedEulerianPath.h)| Eulerian path in a digraph |
83
+
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[DepthFirstOrder.h](ch4/head/DepthFirstOrder.h)| depth-first order in a digraph |[4.5](https://algs4.cs.princeton.edu/42digraph/index.php#4.5)|[Topological.h](ch4/head/Topological.h)| topological order in a DAG |
84
+
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[TopologicalX.h](ch4/head/TopologicalX.h)| topological order (nonrecursive) |[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[TransitiveClosure.h](ch4/head/TransitiveClosure.h)| transitive closure |
85
+
|[-](https://algs4.cs.princeton.edu/42digraph/index.php#-)|[SymbolDigraph.h](ch4/head/SymbolDigraph.h)| symbol digraph |[4.6](https://algs4.cs.princeton.edu/42digraph/index.php#4.6)|[KosarajuSharirSCC.h](ch4/head/KosarajuSharirSCC.h)| strong components (Kosaraju–Sharir) |
0 commit comments