Skip to main content
added 3 characters in body
Source Link
Nathaniel
  • 17k
  • 2
  • 30
  • 55

Consider a complete graph $K_n$. Then a depth-first search can only create a linear-path spanning tree, no matter what the edges processing order is.

Consider a complete graph $K_n$. Then a depth-first search can only create a linear-path spanning tree, no matter what the edges processing order.

Consider a complete graph $K_n$. Then a depth-first search can only create a linear-path spanning tree, no matter what the edges processing order is.

Source Link
Nathaniel
  • 17k
  • 2
  • 30
  • 55

Consider a complete graph $K_n$. Then a depth-first search can only create a linear-path spanning tree, no matter what the edges processing order.