Some Graph Problems

Here are some Graph problems i have solved over time 

Flood Fill/Finding Connected Components using dfs/bfs:

784 - Maze Exploration (UVA)

Solution

10946 - You want what filled? (UVA)
Solution

572 - Oil Deposits (UVA)
Solution

439 - Knight Moves (UVA)
Solution

10653 - Bombs! NO they are Mines!! (UVA)
Solution

352 - The Seasonal War (UVA)
Solution

871 - Counting Cells in a Blob (UVA)
Solution

10336 - Rank the Languages (UVA)
Solution

260 - Il Gioco dell'X (UVA)
Solution

785 - Grid Colouring

Solution

BFS:

336 - A Node Too Far (UVA)
Solution

11730 - Number Transformation (UVA)
Solution

762 - We Ship Cheap (UVA)
Solution

10009 - All Roads Lead Where? (UVA)
Solution

11463 - Commandos (UVA)
Solution

DFS:

615 - Is It A Tree? (UVA)
Solution

11504 - Dominos 2 (UVA)
Solution

280 - Vertex (UVA)
Solution

10452 - Marcus (UVA)
Solution

11770 - Lighting Away (UVA)
Solution

PT07Y - Is it a tree (SPOJ)
Solution

Tropological sort:

10305 - Ordering Tasks (UVA)
Solution

11060 - Beverages (UVA)
Solution

Strongly connected component:

247 - Calling Circles (UVA)
Solution

CAPCITY - Capital City (SPOJ)
Solution

11504 - Dominos
Solution

11838 - Come and Go
Solution

Graph coloring:

A Bug’s Life (SPOJ)
Solution

10004 - Bicoloring
Solution

MST:

908 - Re-connecting Computer Sites
Solution

11631 - Dark roads
Solution

11747 - Heavy Cycle Edges
Solution

10034 - Freckles
Solution

11733 - Airports
Solution

1174 - IP-TV
Solution

11710 - Expensive subway
Solution

11857 - Driving Range
Solution

10048 - Audiophobia (mst+bfs)
Solution

544 - Heavy Cargo
Solution

10099 - Tourist Guide
Solution

10147 - Highways
Solution

10397 - Connect the Campus
Solution

10600 - ACM Contest and Blackout
Solution

11228 - Transportation system.
Solution

11733 - Airports
Solution

11857 - Driving Range

Solution

Dijkstra:

10986 - Sending email
Solution

929 - Number Maze
Solution

bellman ford:

558 - Wormholes
Solution