1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
To create a minimum spanning tree in a strongly connected network, that is in a
network in which there is a path between any two vertices, the edges for the
minimum spanning tree are chosen so that the following properties exist: Every
vertex is included. The total edge weight of the spanning tree is the minimum
possible that includes a path between any two vertices.
4
2
Applications
• Any time you want to visit all vertices in a graph at minimum cost (e.g.,
wire routing on printed circuit boards, sewer pipe layout, road planning…)
• Internet content distribution
– $$$, also a hot research topic
– Idea: publisher produces web pages, content distribution network
replicates web pages to many locations so consumers can access at
higher speed
– MST may not be good enough!
• content distribution on minimum cost tree may take a long
time!
Provides a heuristic for traveling salesman problems.
Given a weighted graph G find a minimum cost spanning tree.
0
3
3 2
2
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 93 ‐
1
1