|
Graph theory - a
discipline with numerous practical applications - is most
of the times a difficult subject for students.
The problem of determining a minimum spanning tree is one
of the problems having multiple economical applications. That's
why we introduced this problem starting from two of its well-known
applications - building a computer network with minimum cost
and rebuilding roads in a county with minimum cost.
Afterwards we presented the problems using graph theory terminology,
defining necessary concepts and we presented two algorithms
for minimum spanning trees: Kruskal algorithm and Prim algorithm.
|
Minimum
spanning trees
