Scribd
Upload
3 views

1-sollinsalgorithm-170924053331

The document discusses Soling's Algorithm, also known as Boruvka's Algorithm, which is used to find the Minimum Spanning Tree (MST) in a graph. It outlines the properties and applications of graphs, spanning trees, and minimum-cost spanning trees, as well as the steps involved in implementing Soling's Algorithm. The document also compares this algorithm with other MST algorithms like Kruskal's and Prim's, emphasizing its greedy approach.

Uploaded by

keerthivasansv2006
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

1-sollinsalgorithm-170924053331

The document discusses Soling's Algorithm, also known as Boruvka's Algorithm, which is used to find the Minimum Spanning Tree (MST) in a graph. It outlines the properties and applications of graphs, spanning trees, and minimum-cost spanning trees, as well as the steps involved in implementing Soling's Algorithm. The document also compares this algorithm with other MST algorithms like Kruskal's and Prim's, emphasizing its greedy approach.

Uploaded by

keerthivasansv2006
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Soling's Algorithm

Department of Electrical Engineering


GC University, Lahore
Engr.Salman
0306-4111558
Contents

1. Graph
2. Basic term associate with Graph
3. Spanning Tree
4. Condition for spanning tree
5. Spanning Tree properties
6. Minimum–cost spanning Tree
7. Application of MST
8. Algorithms for Minimum-cost-spanning tree
9. Sollin’s Algorithm
Graph

 Non-Linear data structure


 A graph G is finite set of vertices and edges G(E,V).
 Graph is used to represent many real life application.like
 Models for electrical wiring
 Social network like facebook, linkedln.
 GPS (Global position system)[1]

Application of graph
Terms associate with graph

 Vertex
 Edge Weight
 Directed and un-directed graph
 A-cyclic graph

Edge
Example of Un-directed graph

Directed a-cyclic graph


Spanning Trees (ST)

 For undirected and connected graph G ,spanning tree T is the subset of


G which contain all vertices and does not have a cycle.[2]
 Example
Remove edges which are producing cycle.

Connected un-directed graph Spanning Tree


Conditions For Spanning tree
 A graph should be connected
 A disconnected graph does not have any spanning tree, as it cannot
be spanned to all its vertices.
 A graph should have at least more than than three vertices
Properties of Spanning Tree

1. For complete undirected graph


Maximum number of spanning tree= nn-2
2. Spanning tree does not have a cycle.
3. Spanning trees have same number of vertices as graph G.
4. All possible spanning tree have same number of vertices and edges.
5. Spanning tree has n-1 edges.
6. If we add an edge to a spanning tree it creat a cycle.
Minimum-cost spanning trees (MST)
 The cost of a spanning tree would be the sum of the costs of its edges
 A minimum-cost spanning tree is a spanning tree that has the lowest cost
 A minimum cost spanning tree is used to find the shortest path.
 Example

Spanning tree
Total cost=1+2+3+4+5=15 MST
Total cost=2+4+5=11
Total cost=1+2+4=7
Conitnue…

 If all the edges have unit cost then all spanning tree are minimal cost
spanning tree and have same cost.
 Because all the spanning tree have dame number of vertices and
edges.
Application of MST

 Minimum spanning trees have direct applications in the design


of networks,.for example
1. computer networks
2. telecommunications networks
3. transportation networks
4. water supply networks
5. electrical grids[3]
Minimax Process

R
2 -3

B
7 2 8 -3
Taxonomy
Algorithms to find MST

1. Kruskal’s algorithm
2. Prim’s algorithm
3. Sollin’s algorithm
Sollin’s Algorithm

 Sollin’s algorithm is also called Boruvka’s algorithm


 It is used to find MST.
 It was given by Boruvkas in 1926.at tthat time it was the first
algorithm to find the MST.
 Boruvka’s Algorithm is a greedy algorithm and is similar to Kruskal’s
algorithm and Prim’s algorithm. [4]
Greedy Algorithm

 Algorithm are designed to solve the problem.


 In greedy algorithm ,first off all we check all the possibilities of a
given problem, then at the first stage we select that which can give
optimal solution .
 At the next stage always choose the next piece that offers the most
benefit.
 Greedy algorithm is an algorithm that builds up a solution piece by
piece.
Steps of Sollin’s Algorithm
1. Write all vertices of a connected graph.
2. Highlight the cheapest outgoing edge of all vertices.
3. Choose only one cheapest edge for each vertex.
4. Repeat the algorithm for each sub graph (each differently colored set). This
time, for each node, choose the cheapest edge outside of the sub-graph.
5. If an edge is already selected then skip it.

0
0 28 10 1
14 16
10 1
14 16 5 6 2
5 6 2 25
24 4 12
25 18
12 3
4 22
22 3 MST
Connected graph
Example

Undirected graphCost =87


Conti…

MST Cost=62
References

 [1]
www.uow.edu.au/~bmaloney/wuct121/GraphsWeek11Lecture2.pdf
 [2]-https://www.tutorialspoint.com/data_structures_algorithms/
spanning_tree.htm
 [3]-https://www.tutorialspoint.com/data_structures_algorithms/
spanning_tree.htm
 [4]-Fundamental of data structure by in c++ by Sartaj //ch#6 pp#361
ANY QUESTION
??

You might also like