Skip to content

Commit df4b08c

Browse files
author
FSou1
committed
Update readme
1 parent 39d2365 commit df4b08c

File tree

1 file changed

+1
-0
lines changed

1 file changed

+1
-0
lines changed

README.md

+1
Original file line numberDiff line numberDiff line change
@@ -33,6 +33,7 @@ An algorithm is a finite sequence of well-defined, computer-implementable instru
3333
* [Depth-first search](src/algorithms/graph/depth-first-search) - traverse a graph, explore descendant vertices first;
3434
* [Dijkstra](src/algorithms/graph/dijkstra) - find the shortest path between two vertices in a graph, return a shortest-path tree;
3535
* [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);
3637

3738
## How to use this repository
3839

0 commit comments

Comments
 (0)