julianapequeno/edges-and-nodes

Implementations of Graph Theory algorithms from different sources. For studying.

👩🏾‍🚀 Graph Theory Algorithms

Note: None of these implementations are mine, I picked them up in the internet and put it all together here. I will let the references to the correspondent authors bellow.

Sumary (& References)

• Matching Algorithms
  • Edmonds Blossom: https://github.com/Yorkyer/edmonds-blossom/tree/master
• Eulerian Circuit
  • Debruijin Sequence: https://www.geeksforgeeks.org/de-bruijn-sequence-set-1/
  • Fleury: https://www.geeksforgeeks.org/fleurys-algorithm-for-printing-eulerian-path/
  • Hierholzers: https://www.geeksforgeeks.org/hierholzers-algorithm-directed-graph/
• Network Flow:
  • Ford Fulkerson: https://www.w3schools.com/dsa/dsa_algo_graphs_fordfulkerson.php#:~:text=The%20Ford%2DFulkerson%20algorithm%20works,the%20maximum%20flow%20is%20reached.
  • Goldberg-Tarjan: https://github.com/JasonC89/goldberg-tarjan
• Shortest Path:
  • Dijkstra: https://www.w3schools.com/dsa/dsa_algo_graphs_dijkstra.php
  • Floyd Warshall: https://www.geeksforgeeks.org/floyd-warshall-algorithm-dp-16/
  • Bellman-Ford: https://www.geeksforgeeks.org/bellman-ford-algorithm-dp-23/