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
Copy file name to clipboardExpand all lines: README.md
+1
Original file line number
Diff line number
Diff line change
@@ -33,6 +33,7 @@ An algorithm is a finite sequence of well-defined, computer-implementable instru
33
33
*[Depth-first search](src/algorithms/graph/depth-first-search) - traverse a graph, explore descendant vertices first;
34
34
*[Dijkstra](src/algorithms/graph/dijkstra) - find the shortest path between two vertices in a graph, return a shortest-path tree;
35
35
*[Bellman-Ford](src/algorithms/graph/bellman-ford) - find the shortest path in a graph with negative edges, return a shortest-path tree;
36
+
*[Topological sort](src/algorithms/graph/topological) - an algorithm for topological sorting, which is based on [depth-first search](src/algorithms/graph/depth-first-search);
0 commit comments