Update README.

This commit is contained in:
Oleksii Trekhleb 2018-05-06 22:04:36 +03:00
parent eec2df994c
commit dc2b7ce0ae

View File

@ -69,13 +69,12 @@
* [Dijkstra Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/dijkstra) - finding shortest path to all graph vertices
* [Bellman-Ford Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/bellman-ford) - finding shortest path to all graph vertices
* [Detect Cycle](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/detect-cycle) - for both directed and undirected graphs (DFS and Disjoint Set based versions)
* Prims Algorithm - finding Minimum Spanning Tree (MST)
* Kruskals Algorithm - finding Minimum Spanning Tree (MST)
* Topological Sorting
* Eulerian path, Eulerian circuit
* Strongly Connected Component algorithm
* Shortest Path Faster Algorithm (SPFA)
* **Minimum Spanning Tree**
* Prims algorithm
* Kruskals algorithm
* **Uncategorized**
* Union-Find
* Maze