Name the traversal that finds a minimum-edge path in an unweighted graph

from CS foundations
intermediate 1 min

Name the traversal that finds a minimum-edge path in an unweighted graph.

Report an error