Академический Документы
Профессиональный Документы
Культура Документы
GRAPHS : DEFINITIONS
Graphs
9/22/16
Graphs
9/22/16
DEFINITIONS:
Graphs
9/22/16
Graphs
9/22/16
Weighted graphs
Edges
2
4
5
b
2
c
1
9/22/16
d
4
Graphs
DEFINITIONS :
Graphs
9/22/16
COMPLETE GRAPH.
An undirected graph, in which every vertex has
an edge to all other vertices is called complete
graph. Maximum number of edges in complete
graph is n(n-1)/2. In a directed graph, the max
number of edges is n(n-1).
Graphs
9/22/16
CONNECTED GRAPH:
Graphs
9/22/16
SUBGRAPH:
C
SUBGRAPHS
Graphs
9/22/16
10
SPANNING TREE
PPT
SPANNING TREE
2
4
Graphs
9/22/16
12
2
a
d
5
10
h
g
3
f
d
5
10
h
g
3
f
Prims Algorithm
Kruskals Algorithm
Graphs
9/22/16
15
PRIMS ALGORITHM
Graphs
9/22/16
16
PRIMS
ALGORITHM
Find out
minimum cost & spanning tree for
following graph by applying Prims algorithm
1000
Bombay
Lonavala
4000
Pune
Graphs
2500
9/22/16
17
PRIMS
ALGORITHM
Spanning
tree using Prims algorithm is
1000
Bombay
Lonavala
Pune
2500
Graphs
9/22/16
18
2
6
5
6
Graphs
9/22/16
19
0
1
1
0
--
--
Graphs
9/22/16
Visited
distance
from
20
A
17
15
F
10
19
E
14
Graphs
9/22/16
2
6
21
KRUSKALS ALGORITHM:
Graphs
9/22/16
22
A
17
15
F
10
19
E
14
Graphs
9/22/16
2
6
23