Graphs

Model dependencies and networks, and find orders, components and cheapest routes through them.

6 challenges · ~6 h

1. 1Build a Dependency ResolverFreetopological sort and cycle detectionIntermediate~55 minNot started
2. 2Implement BFS and DFS on GridsFreeflood fill and grid shortest pathsIntermediate~55 minNot started
3. 3Build a Union-FindFreeunion by size and path compressionIntermediate~55 minNot started
4. 4Implement Kruskal's and Prim's MSTFreegreedy edge and vertex growthAdvanced~60 minNot started
5. 5Implement Dijkstra's Shortest PathFreeheap-based shortest pathsAdvanced~60 minNot started
6. 6Implement Bellman-Ford and Floyd-WarshallFreenegative edges and all-pairs pathsAdvanced~60 minNot started