I've found a typo in CLRS Appendix B.5 Trees Hi! I've…
0 reactions
I've found a typo in CLRS Appendix B.5 Trees
Hi!
I've decided to refresh my graph theory using CLRS 4th edition. They define a free tree as a connected, acyclic, undirected graph. None of these conditions prevent us from having null graph with zero vertices and zero edges.
On page 1170, it is proven that for a free tree, |E| = |V| - 1. We can derive contradiction from it: |0| = |0| - 1 -> 0 = -1
Please, confirm it and then I will report it to errata.
#technology
source
Hi!
I've decided to refresh my graph theory using CLRS 4th edition. They define a free tree as a connected, acyclic, undirected graph. None of these conditions prevent us from having null graph with zero vertices and zero edges.
On page 1170, it is proven that for a free tree, |E| = |V| - 1. We can derive contradiction from it: |0| = |0| - 1 -> 0 = -1
Please, confirm it and then I will report it to errata.
#technology
source
| 4,000 mlx | |
| 6 | |
| 0 |