SOLVING MAZES

GIVEN A CONNECTED GRAPH, COMPUTE THE MINIMUM SPANNING TREE (MST)

DETECTING A BIPARTITE GRAPH

GIVEN A DIRECT ACYCLIC GRAPH, IMPLEMENT A TOPOLOGICAL SORT

COVERING DFS TREES

COVERING DFS TREES

FIND AN HAMILTONIAN CYCLE

FIND THE SHORTEST PATH IN A GRAPH WITH NON-NEGATIVE EDGE WEIGHT

FIND THE ARTICULATION POINTS IN A GRAPH

Games of Coins – a set of coins are aligned and two players can pick one coin from each side in turn. Maximize the value of the coins picked by the first player

FIND THE SHORTEST PATH IN A GRAPH WITH NON-NEGATIVE EDGE WEIGHT