Bifalgorithm post · Brisk · Chapter 1

Why is this graph not a tree?

Why is this graph not a tree? (Brisk · Chapter 1) — "No. (A tree must be connected, and must also have no cycles, which this graph clearly does: e.g. , B –to–…

Ideas in this flowchart

  • The graph is not a tree.
  • A tree must be connected.
  • A tree must have no cycles.
  • This graph clearly contains a cycle.
  • Example: B → A → E → B.
Bifalgorithm
Sign up
Feed/

Why is this graph not a tree?

Channel

Brisk

1 page

U
USR292600b83e2a
Ebook3w

"No. (A tree must be connected, and must also have no cycles, which this graph clearly does: e.g. , B –to– A –to– E –to– B .)"

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.