Graph Algorithms

35/36 Solved

Counting Rooms

bfs

C++

Labyrinth

bfs

C++

Building Roads

bfs dfs forest counting

C++

Message Route

bfs

C++

Building Teams

bicoloring dfs

C++

Round Trip

cycle in undirected graph dfs

C++

Monsters

bfs

C++

Shortest Routes I

single source shortest path dijkstra

C++

Shortest Routes II

all pair shortes path floyd warshall

C++

High Score

single source shortest path bellman ford

C++

Flight Discount

single source shortest path dijkstra

C++

Cycle Finding

negative cycle bellman ford

C++

Flight Routes

C++

Round Trip II

dfs cycle in directed graph

C++

Course Schedule

topological sort

C++

Longest Flight Route

topological sort dp

C++

Game Routes

topological sort dp

C++

Investigation

dijkstra

C++

Planets Queries I

binary lifting

C++

Planets Queries II

Planets Cycles

dfs

C++

Road Reparation

minimum spanning tree kruskal

C++

Road Construction

dsu

C++

Flight Routes Check

strongly connected components

C++

Planets and Kingdoms

strongly connected components

C++

Giant Pizza

2-sat

C++

Coin Collector

condensation graph topological sort dp

C++

Mail Delivery

euler tour - undirected

C++

De Bruijn Sequence

C++

Teleporters Path

euler path - directed

C++

Hamiltonian Flights

hamiltonian path bitmask dp

C++

Knight's Tour

hamiltonian path heuristics

C++

Download Speed

max flow min cut push relabel dinic

C++

Police Chase

max flow min cut push relabel

C++

School Dance

max flowbipartite matching hopkroft carp

C++

Distinct Routes

max flow dinic path reconstruction

C++