Graph Algorithms problems
PageRank, shortest paths, centrality. Networks, traversed.
360 problems126 Easy163 Medium71 Hard
50 problems
Adjacency List Build
graph-001
Adjacency Matrix Build
graph-002
BFS Traversal Order
graph-003
DFS Traversal Order (Iterative)
graph-004
Connected Components Count
graph-005
Bipartite Check
graph-006
Floyd-Warshall Small
graph-007
Graph Density
graph-008
Degree Centrality
graph-009
In/Out Degree Stats
graph-010
PageRank One Iteration
graph-011
Clustering Coefficient (Local)
graph-012
Triangle Count
graph-013
Number of Islands via Graph Traversal
graph-014
Clone Graph
graph-015
Graph Valid Tree Check
graph-016
Cycle Detection Undirected
graph-017
Cycle Detection Directed
graph-018
Topological Sort (Kahn)
graph-019
BFS Shortest Path Unweighted
graph-020
Dijkstra with Heap
graph-021
Network Delay Time
graph-022
Bellman-Ford with Negative Edges
graph-023
Prim MST Weight
graph-024
Kruskal MST Weight
graph-025
Redundant Connection (DSU)
graph-026
PageRank Iterate to Tolerance
graph-027
Personalized PageRank
graph-028
Closeness Centrality
graph-029
Path Count via Matrix Powers
graph-030
Graph Diameter by BFS
graph-031
K-Core Numbers
graph-032
Course Schedule Order
graph-033
Snake and Ladder BFS
graph-034
Grid Shortest Path with Obstacles
graph-035
Rotting Oranges Minutes
graph-036
Bridges Count
graph-037
Articulation Points Count
graph-038
SCC Count (Kosaraju)
graph-039
Betweenness Centrality (Brandes-lite)
graph-040
Eigenvector Centrality (Power Iteration)
graph-041
Critical Path Length
graph-042
Word Ladder Length
graph-043
Cheapest Flights Within K Stops
graph-044
Path with Minimum Effort
graph-045
Eulerian Path Existence
graph-046
Eulerian Circuit Existence
graph-047
Hamiltonian Path Check
graph-048
TSP Nearest-Neighbor Tour
graph-049
TSP 2-Opt Improvement Step
graph-050
Showing 50 of 360 problems.