algs-datastruc

About

Own implementation of most intresting/useful graph algorithms with optimizations.
This includes:

• BFS/DFS (search)
• Bellman-Ford/Dijsktra/Floyd-Warshall (shortest paths)
• Krukal/Prim (creating min-span tree)
• Kosaraju (finding ssc in directed graphs)
• Fleury's (finding Eulerian cycle [if exists])
• time comparisions
• few more

Author

Paweł Fijałkowski
Data Science
Warsaw University of Technology