Kruskal & Prim algorithm (with proof)

Kruskal & Prim with proof algorithms to find a minimum weight spanning tree
The methods consists of
- Sorting the edges by increasing weight;
- Constructing a spanning tree by adding one of the smallest available edge s in each step.

pdf||2 pages

Planar Graph Drawing - T. Nishizeki, M. Rahman

Planar Graph Drawing - T. Nishizeki, M. Rahman

ISBN  981-256-033-5 

Graph Theory With Applications - J. Bondy, U. Murty

Graph Theory With Applications - J. Bondy, U. Murty

Graph Theory - R. Diestel

Graph Theory - R. Diestel

• Hardcover: 415 pages
• Publisher: Springer; 3rd edition (August 22, 2005)
• Language: English
• ISBN-10: 3540261826
• ISBN-13: 978-3540261827

Algorithmic Graph Theory - Joyner, Nguyen, Cohen - Creative Commons (2011)

Algorithmic Graph Theory - Joyner, Nguyen, Cohen - Creative Commons (2011)

Edition
Version 0.7-r1843
2011 May 01