Bifalgorithm post · Brisk · Chapter 1

What properties does a free tree have?

What properties does a free tree have? (Brisk · Chapter 1) — "If you have a free tree, the following interesting facts are true: 1. There’s exactly one path be…

Ideas in this flowchart

  • Interesting facts about a free tree
  • The graph is assumed to be a free tree
  • There is exactly one path between any two nodes
  • Check the uniqueness of the path
  • Removing any edge makes the graph disconnected
  • Try removing an edge
  • Adding any new edge creates a cycle
  • Try adding a new edge
Bifalgorithm
Sign up
Feed/

What properties does a free tree have?

Channel

Brisk

1 page

U
USR292600b83e2a
Ebook3w

"If you have a free tree, the following interesting facts are true: 1. There’s exactly one path between any two nodes. (Check it!) 2. If you remove any edge, the graph becomes disconnected. (Try it!) 3. If you add any new edge, you end up adding a cycle. (Try it!)"

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.