lecture16: tree-like networks

This lecture covers tree-like networks, and algorithms for their design.

Topics covered

• Tree-like networks
• Spanning Tree
• Spanning Tree Protocol
• Port costs
• Spanning Tree Protocol
• Spanning Tree Protocol Example
• Algorhyme
• Minimum Spanning Trees
• Forests
• Properties of importance
• Greedy methods
• Kruskal's method
• Kruskal's method example
• Kruskal's method proof
• Kruskal's method's complexity
• Prim's Method
• Prim's method example
• Prim's method details
• Relationship to other algorithms
• Miscellany