Use Case:

Question 1

Name graph algorithms that are used for:Traversing a Graph

Answer 1

DFS, Explore, BFS

Question 2

Name graph algorithms that are used for:Getting Components

Answer 2

SCC

Question 3

Name graph algorithms that are used for:Getting Shortest Paths

Answer 3

Dijkstra’s, Bellman Ford, Floyd Warshall

Question 4

Name graph algorithm that are used for:Finding MSTs

Answer 4

Kruskal’s, Prims

Question 5

Name graph algorithm that are used for:finding an existing path

Answer 5

2-SAT

Question 6

Name graph algorithms that are used for: Finding the Max Flow

Answer 6

Ford-FulkersonEdmonds-Karp

Question 7

What is the best algorithm for determining the shortest path of graph G that is weighted with positive weights?

Answer 7

Djikstra’s

Question 8

What are the best algorithms for determining the shortest path of graph G that is weighted with negative weights?

Answer 8

Bellman Ford or Floyd Warshall

Question 9

What are the best algorithms for determining the best capacity?

Answer 9

Ford-Fulkerson and Edmonds-Karp

Question 10

What is the best algorithm to convert a graph to a topologically sorted DAG?

Answer 10

SCC

Question 11

What is the best algorithm to find the shortest path from all vertices of a directed, weighted graph with negative weights?

Answer 11

Floyd Warshall

Question 12

What is the best algorithm to find the shortest path from a given vertex of a directed, weighted graph with negative weights?

Answer 12

Bellman Ford