MCQ Bank

Cycle detection in a directed graph can be performed using depth-first search by looking for a:

A topological ordering can be produced for which type of graph?

Depth-first search of a graph is naturally implemented using:

Breadth-first search of a graph is typically implemented using which data structure?

Which algorithm can compute shortest paths in a graph that contains negative edge weights?

Which algorithm finds shortest paths from a single source in a graph with non-negative edge weights?