01Dijkstra's algorithm fails when there are:
02Which algorithm finds the MST by sorting edges and adding them if they don't form a cycle?
03What is the time complexity of Bellman-Ford?
04What is a Minimum Spanning Tree (MST)?
05Prim's algorithm is similar to Dijkstra's but it:
06Which algorithm detects negative cycles?
07Floyd-Warshall algorithm finds:
08The Union-Find (Disjoint Set) data structure is used by:
09What is 'A* Search'?
10The Travelling Salesperson Problem (TSP) is: