Submit Search
Upload
8. Graph - Data Structures using C++ by Varsha Patil
•
Download as PPTX, PDF
•
11 likes
•
3,288 views
W
widespreadpromotion
Follow
8. Graph - Data Structures using C++ by Varsha Patil
Read less
Read more
Data & Analytics
Report
Share
Report
Share
1 of 34
Download now
Recommended
Graph in data structure
Graph in data structure
Abrish06
Adjacency list
Adjacency list
Stefi Yu
Data structure - Graph
Data structure - Graph
Madhu Bala
Data structures using c
Data structures using c
Prof. Dr. K. Adisesha
Graphs data structures
Graphs data structures
Jasleen Kaur (Chandigarh University)
Graph Data Structure
Graph Data Structure
Keno benti
Unit 3 graph chapter6
Unit 3 graph chapter6
DrkhanchanaR
Abstract Data Types
Abstract Data Types
karthikeyanC40
Recommended
Graph in data structure
Graph in data structure
Abrish06
Adjacency list
Adjacency list
Stefi Yu
Data structure - Graph
Data structure - Graph
Madhu Bala
Data structures using c
Data structures using c
Prof. Dr. K. Adisesha
Graphs data structures
Graphs data structures
Jasleen Kaur (Chandigarh University)
Graph Data Structure
Graph Data Structure
Keno benti
Unit 3 graph chapter6
Unit 3 graph chapter6
DrkhanchanaR
Abstract Data Types
Abstract Data Types
karthikeyanC40
Sparse matrix and its representation data structure
Sparse matrix and its representation data structure
Vardhil Patel
Graph representation
Graph representation
Tech_MX
Graphs in data structure
Graphs in data structure
hamza javed
Graph theory
Graph theory
Manash Kumar Mondal
Tree and Binary Search tree
Tree and Binary Search tree
Muhazzab Chouhadry
Minimum spanning tree
Minimum spanning tree
Hinal Lunagariya
Data Structures - Lecture 10 [Graphs]
Data Structures - Lecture 10 [Graphs]
Muhammad Hammad Waseem
Graph traversals in Data Structures
Graph traversals in Data Structures
Anandhasilambarasan D
Time and space complexity
Time and space complexity
Ankit Katiyar
Graph theory
Graph theory
iranian translate
Algorithms Lecture 2: Analysis of Algorithms I
Algorithms Lecture 2: Analysis of Algorithms I
Mohamed Loey
Graphs In Data Structure
Graphs In Data Structure
Anuj Modi
Graphs in data structures
Graphs in data structures
Savit Chandra
Complexity analysis in Algorithms
Complexity analysis in Algorithms
Daffodil International University
UNIT I LINEAR DATA STRUCTURES – LIST
UNIT I LINEAR DATA STRUCTURES – LIST
Kathirvel Ayyaswamy
heap Sort Algorithm
heap Sort Algorithm
Lemia Algmri
DESIGN AND ANALYSIS OF ALGORITHMS
DESIGN AND ANALYSIS OF ALGORITHMS
Gayathri Gaayu
Tree Data Structure by Daniyal Khan
Tree Data Structure by Daniyal Khan
Daniyal Khan
DATA STRUCTURES
DATA STRUCTURES
bca2010
single linked list
single linked list
Sathasivam Rangasamy
7. Tree - Data Structures using C++ by Varsha Patil
7. Tree - Data Structures using C++ by Varsha Patil
widespreadpromotion
5. Queue - Data Structures using C++ by Varsha Patil
5. Queue - Data Structures using C++ by Varsha Patil
widespreadpromotion
More Related Content
What's hot
Sparse matrix and its representation data structure
Sparse matrix and its representation data structure
Vardhil Patel
Graph representation
Graph representation
Tech_MX
Graphs in data structure
Graphs in data structure
hamza javed
Graph theory
Graph theory
Manash Kumar Mondal
Tree and Binary Search tree
Tree and Binary Search tree
Muhazzab Chouhadry
Minimum spanning tree
Minimum spanning tree
Hinal Lunagariya
Data Structures - Lecture 10 [Graphs]
Data Structures - Lecture 10 [Graphs]
Muhammad Hammad Waseem
Graph traversals in Data Structures
Graph traversals in Data Structures
Anandhasilambarasan D
Time and space complexity
Time and space complexity
Ankit Katiyar
Graph theory
Graph theory
iranian translate
Algorithms Lecture 2: Analysis of Algorithms I
Algorithms Lecture 2: Analysis of Algorithms I
Mohamed Loey
Graphs In Data Structure
Graphs In Data Structure
Anuj Modi
Graphs in data structures
Graphs in data structures
Savit Chandra
Complexity analysis in Algorithms
Complexity analysis in Algorithms
Daffodil International University
UNIT I LINEAR DATA STRUCTURES – LIST
UNIT I LINEAR DATA STRUCTURES – LIST
Kathirvel Ayyaswamy
heap Sort Algorithm
heap Sort Algorithm
Lemia Algmri
DESIGN AND ANALYSIS OF ALGORITHMS
DESIGN AND ANALYSIS OF ALGORITHMS
Gayathri Gaayu
Tree Data Structure by Daniyal Khan
Tree Data Structure by Daniyal Khan
Daniyal Khan
DATA STRUCTURES
DATA STRUCTURES
bca2010
single linked list
single linked list
Sathasivam Rangasamy
What's hot
(20)
Sparse matrix and its representation data structure
Sparse matrix and its representation data structure
Graph representation
Graph representation
Graphs in data structure
Graphs in data structure
Graph theory
Graph theory
Tree and Binary Search tree
Tree and Binary Search tree
Minimum spanning tree
Minimum spanning tree
Data Structures - Lecture 10 [Graphs]
Data Structures - Lecture 10 [Graphs]
Graph traversals in Data Structures
Graph traversals in Data Structures
Time and space complexity
Time and space complexity
Graph theory
Graph theory
Algorithms Lecture 2: Analysis of Algorithms I
Algorithms Lecture 2: Analysis of Algorithms I
Graphs In Data Structure
Graphs In Data Structure
Graphs in data structures
Graphs in data structures
Complexity analysis in Algorithms
Complexity analysis in Algorithms
UNIT I LINEAR DATA STRUCTURES – LIST
UNIT I LINEAR DATA STRUCTURES – LIST
heap Sort Algorithm
heap Sort Algorithm
DESIGN AND ANALYSIS OF ALGORITHMS
DESIGN AND ANALYSIS OF ALGORITHMS
Tree Data Structure by Daniyal Khan
Tree Data Structure by Daniyal Khan
DATA STRUCTURES
DATA STRUCTURES
single linked list
single linked list
Viewers also liked
7. Tree - Data Structures using C++ by Varsha Patil
7. Tree - Data Structures using C++ by Varsha Patil
widespreadpromotion
5. Queue - Data Structures using C++ by Varsha Patil
5. Queue - Data Structures using C++ by Varsha Patil
widespreadpromotion
6. Linked list - Data Structures using C++ by Varsha Patil
6. Linked list - Data Structures using C++ by Varsha Patil
widespreadpromotion
9. Searching & Sorting - Data Structures using C++ by Varsha Patil
9. Searching & Sorting - Data Structures using C++ by Varsha Patil
widespreadpromotion
3. Stack - Data Structures using C++ by Varsha Patil
3. Stack - Data Structures using C++ by Varsha Patil
widespreadpromotion
10. Search Tree - Data Structures using C++ by Varsha Patil
10. Search Tree - Data Structures using C++ by Varsha Patil
widespreadpromotion
4. Recursion - Data Structures using C++ by Varsha Patil
4. Recursion - Data Structures using C++ by Varsha Patil
widespreadpromotion
2. Linear Data Structure Using Arrays - Data Structures using C++ by Varsha P...
2. Linear Data Structure Using Arrays - Data Structures using C++ by Varsha P...
widespreadpromotion
11. Hashing - Data Structures using C++ by Varsha Patil
11. Hashing - Data Structures using C++ by Varsha Patil
widespreadpromotion
1. Fundamental Concept - Data Structures using C++ by Varsha Patil
1. Fundamental Concept - Data Structures using C++ by Varsha Patil
widespreadpromotion
មេរៀនៈ Data Structure and Algorithm in C/C++
មេរៀនៈ Data Structure and Algorithm in C/C++
Ngeam Soly
Ds 111011055724-phpapp01
Ds 111011055724-phpapp01
Getachew Ganfur
Stack & Queue
Stack & Queue
Joyjit Choudhury
Question answering in linked data
Question answering in linked data
Reza Ramezani
C++ Constructor destructor
C++ Constructor destructor
Da Mystic Sadi
Mca ii dfs u-3 linklist,stack,queue
Mca ii dfs u-3 linklist,stack,queue
Rai University
The State of Twitter: STL 2011
The State of Twitter: STL 2011
Infuz
Classes and objects1
Classes and objects1
Vineeta Garg
Constructors and destructors
Constructors and destructors
Vineeta Garg
Advanced data structures using c++ 3
Advanced data structures using c++ 3
Shaili Choudhary
Viewers also liked
(20)
7. Tree - Data Structures using C++ by Varsha Patil
7. Tree - Data Structures using C++ by Varsha Patil
5. Queue - Data Structures using C++ by Varsha Patil
5. Queue - Data Structures using C++ by Varsha Patil
6. Linked list - Data Structures using C++ by Varsha Patil
6. Linked list - Data Structures using C++ by Varsha Patil
9. Searching & Sorting - Data Structures using C++ by Varsha Patil
9. Searching & Sorting - Data Structures using C++ by Varsha Patil
3. Stack - Data Structures using C++ by Varsha Patil
3. Stack - Data Structures using C++ by Varsha Patil
10. Search Tree - Data Structures using C++ by Varsha Patil
10. Search Tree - Data Structures using C++ by Varsha Patil
4. Recursion - Data Structures using C++ by Varsha Patil
4. Recursion - Data Structures using C++ by Varsha Patil
2. Linear Data Structure Using Arrays - Data Structures using C++ by Varsha P...
2. Linear Data Structure Using Arrays - Data Structures using C++ by Varsha P...
11. Hashing - Data Structures using C++ by Varsha Patil
11. Hashing - Data Structures using C++ by Varsha Patil
1. Fundamental Concept - Data Structures using C++ by Varsha Patil
1. Fundamental Concept - Data Structures using C++ by Varsha Patil
មេរៀនៈ Data Structure and Algorithm in C/C++
មេរៀនៈ Data Structure and Algorithm in C/C++
Ds 111011055724-phpapp01
Ds 111011055724-phpapp01
Stack & Queue
Stack & Queue
Question answering in linked data
Question answering in linked data
C++ Constructor destructor
C++ Constructor destructor
Mca ii dfs u-3 linklist,stack,queue
Mca ii dfs u-3 linklist,stack,queue
The State of Twitter: STL 2011
The State of Twitter: STL 2011
Classes and objects1
Classes and objects1
Constructors and destructors
Constructors and destructors
Advanced data structures using c++ 3
Advanced data structures using c++ 3
Similar to 8. Graph - Data Structures using C++ by Varsha Patil
Spanningtreesppt
Spanningtreesppt
Jyoshna Cec Cse Staf bejjam
NON-LINEAR DATA STRUCTURE-Graphs.pptx
NON-LINEAR DATA STRUCTURE-Graphs.pptx
Rajitha Reddy Alugati
Ch18
Ch18
leminhvuong
Slides Chapter10.1 10.2
Slides Chapter10.1 10.2
showslidedump
Graph terminology and algorithm and tree.pptx
Graph terminology and algorithm and tree.pptx
asimshahzad8611
Lecture 2.3.1 Graph.pptx
Lecture 2.3.1 Graph.pptx
king779879
Graph data structure and algorithms
Graph data structure and algorithms
Anandhasilambarasan D
Lecture 5b graphs and hashing
Lecture 5b graphs and hashing
Victor Palmar
Graph_data_structure_information_engineering.pptx
Graph_data_structure_information_engineering.pptx
sahilpawar2426
Graph.pptx
Graph.pptx
Nasir Hussain
09_DS_MCA_Graphs.pdf
09_DS_MCA_Graphs.pdf
Prasanna David
PPT on Graph Theory ( Tree, Cotree, nodes, branches, incidence , tie set and ...
PPT on Graph Theory ( Tree, Cotree, nodes, branches, incidence , tie set and ...
SUTAPAMUKHERJEE12
H0431038048
H0431038048
ijceronline
Graphs.pptx
Graphs.pptx
satvikkushwaha1
Semantic Data Management in Graph Databases
Semantic Data Management in Graph Databases
Maribel Acosta Deibe
Chapter9 graph data structure
Chapter9 graph data structure
Mahmoud Alfarra
Basics of graph
Basics of graph
Khaled Sany
Graph Introduction.ppt
Graph Introduction.ppt
Faruk Hossen
Graph theory concepts complex networks presents-rouhollah nabati
Graph theory concepts complex networks presents-rouhollah nabati
nabati
Dijkstra
Dijkstra
jagdeeparora86
Similar to 8. Graph - Data Structures using C++ by Varsha Patil
(20)
Spanningtreesppt
Spanningtreesppt
NON-LINEAR DATA STRUCTURE-Graphs.pptx
NON-LINEAR DATA STRUCTURE-Graphs.pptx
Ch18
Ch18
Slides Chapter10.1 10.2
Slides Chapter10.1 10.2
Graph terminology and algorithm and tree.pptx
Graph terminology and algorithm and tree.pptx
Lecture 2.3.1 Graph.pptx
Lecture 2.3.1 Graph.pptx
Graph data structure and algorithms
Graph data structure and algorithms
Lecture 5b graphs and hashing
Lecture 5b graphs and hashing
Graph_data_structure_information_engineering.pptx
Graph_data_structure_information_engineering.pptx
Graph.pptx
Graph.pptx
09_DS_MCA_Graphs.pdf
09_DS_MCA_Graphs.pdf
PPT on Graph Theory ( Tree, Cotree, nodes, branches, incidence , tie set and ...
PPT on Graph Theory ( Tree, Cotree, nodes, branches, incidence , tie set and ...
H0431038048
H0431038048
Graphs.pptx
Graphs.pptx
Semantic Data Management in Graph Databases
Semantic Data Management in Graph Databases
Chapter9 graph data structure
Chapter9 graph data structure
Basics of graph
Basics of graph
Graph Introduction.ppt
Graph Introduction.ppt
Graph theory concepts complex networks presents-rouhollah nabati
Graph theory concepts complex networks presents-rouhollah nabati
Dijkstra
Dijkstra
More from widespreadpromotion
Discrete Mathematics S. Lipschutz, M. Lipson And V. H. Patil
Discrete Mathematics S. Lipschutz, M. Lipson And V. H. Patil
widespreadpromotion
16. Algo analysis & Design - Data Structures using C++ by Varsha Patil
16. Algo analysis & Design - Data Structures using C++ by Varsha Patil
widespreadpromotion
15. STL - Data Structures using C++ by Varsha Patil
15. STL - Data Structures using C++ by Varsha Patil
widespreadpromotion
14. Files - Data Structures using C++ by Varsha Patil
14. Files - Data Structures using C++ by Varsha Patil
widespreadpromotion
13. Indexing MTrees - Data Structures using C++ by Varsha Patil
13. Indexing MTrees - Data Structures using C++ by Varsha Patil
widespreadpromotion
12. Heaps - Data Structures using C++ by Varsha Patil
12. Heaps - Data Structures using C++ by Varsha Patil
widespreadpromotion
More from widespreadpromotion
(6)
Discrete Mathematics S. Lipschutz, M. Lipson And V. H. Patil
Discrete Mathematics S. Lipschutz, M. Lipson And V. H. Patil
16. Algo analysis & Design - Data Structures using C++ by Varsha Patil
16. Algo analysis & Design - Data Structures using C++ by Varsha Patil
15. STL - Data Structures using C++ by Varsha Patil
15. STL - Data Structures using C++ by Varsha Patil
14. Files - Data Structures using C++ by Varsha Patil
14. Files - Data Structures using C++ by Varsha Patil
13. Indexing MTrees - Data Structures using C++ by Varsha Patil
13. Indexing MTrees - Data Structures using C++ by Varsha Patil
12. Heaps - Data Structures using C++ by Varsha Patil
12. Heaps - Data Structures using C++ by Varsha Patil
Recently uploaded
Decoding the Heart: Student Presentation on Heart Attack Prediction with Data...
Decoding the Heart: Student Presentation on Heart Attack Prediction with Data...
Boston Institute of Analytics
What To Do For World Nature Conservation Day by Slidesgo.pptx
What To Do For World Nature Conservation Day by Slidesgo.pptx
SimranPal17
Real-Time AI Streaming - AI Max Princeton
Real-Time AI Streaming - AI Max Princeton
Timothy Spann
English-8-Q4-W3-Synthesizing-Essential-Information-From-Various-Sources-1.pdf
English-8-Q4-W3-Synthesizing-Essential-Information-From-Various-Sources-1.pdf
blazblazml
Insurance Churn Prediction Data Analysis Project
Insurance Churn Prediction Data Analysis Project
Boston Institute of Analytics
Student Profile Sample report on improving academic performance by uniting gr...
Student Profile Sample report on improving academic performance by uniting gr...
Seán Kennedy
Principles and Practices of Data Visualization
Principles and Practices of Data Visualization
KianJazayeri1
FAIR, FAIRsharing, FAIR Cookbook and ELIXIR - Sansone SA - Boston 2024
FAIR, FAIRsharing, FAIR Cookbook and ELIXIR - Sansone SA - Boston 2024
Susanna-Assunta Sansone
wepik-insightful-infographics-a-data-visualization-overview-20240401133220kwr...
wepik-insightful-infographics-a-data-visualization-overview-20240401133220kwr...
KarteekMane1
Student profile product demonstration on grades, ability, well-being and mind...
Student profile product demonstration on grades, ability, well-being and mind...
Seán Kennedy
Advanced Machine Learning for Business Professionals
Advanced Machine Learning for Business Professionals
VICTOR MAESTRE RAMIREZ
Bank Loan Approval Analysis: A Comprehensive Data Analysis Project
Bank Loan Approval Analysis: A Comprehensive Data Analysis Project
Boston Institute of Analytics
Cyber awareness ppt on the recorded data
Cyber awareness ppt on the recorded data
TecnoIncentive
Digital Marketing Plan, how digital marketing works
Digital Marketing Plan, how digital marketing works
deepakthakur548787
Decoding Patterns: Customer Churn Prediction Data Analysis Project
Decoding Patterns: Customer Churn Prediction Data Analysis Project
Boston Institute of Analytics
Data Analysis Project: Stroke Prediction
Data Analysis Project: Stroke Prediction
Boston Institute of Analytics
INTRODUCTION TO Natural language processing
INTRODUCTION TO Natural language processing
socarem879
SMOTE and K-Fold Cross Validation-Presentation.pptx
SMOTE and K-Fold Cross Validation-Presentation.pptx
HaritikaChhatwal1
Networking Case Study prepared by teacher.pptx
Networking Case Study prepared by teacher.pptx
HimangsuNath
Easter Eggs From Star Wars and in cars 1 and 2
Easter Eggs From Star Wars and in cars 1 and 2
17djon017
Recently uploaded
(20)
Decoding the Heart: Student Presentation on Heart Attack Prediction with Data...
Decoding the Heart: Student Presentation on Heart Attack Prediction with Data...
What To Do For World Nature Conservation Day by Slidesgo.pptx
What To Do For World Nature Conservation Day by Slidesgo.pptx
Real-Time AI Streaming - AI Max Princeton
Real-Time AI Streaming - AI Max Princeton
English-8-Q4-W3-Synthesizing-Essential-Information-From-Various-Sources-1.pdf
English-8-Q4-W3-Synthesizing-Essential-Information-From-Various-Sources-1.pdf
Insurance Churn Prediction Data Analysis Project
Insurance Churn Prediction Data Analysis Project
Student Profile Sample report on improving academic performance by uniting gr...
Student Profile Sample report on improving academic performance by uniting gr...
Principles and Practices of Data Visualization
Principles and Practices of Data Visualization
FAIR, FAIRsharing, FAIR Cookbook and ELIXIR - Sansone SA - Boston 2024
FAIR, FAIRsharing, FAIR Cookbook and ELIXIR - Sansone SA - Boston 2024
wepik-insightful-infographics-a-data-visualization-overview-20240401133220kwr...
wepik-insightful-infographics-a-data-visualization-overview-20240401133220kwr...
Student profile product demonstration on grades, ability, well-being and mind...
Student profile product demonstration on grades, ability, well-being and mind...
Advanced Machine Learning for Business Professionals
Advanced Machine Learning for Business Professionals
Bank Loan Approval Analysis: A Comprehensive Data Analysis Project
Bank Loan Approval Analysis: A Comprehensive Data Analysis Project
Cyber awareness ppt on the recorded data
Cyber awareness ppt on the recorded data
Digital Marketing Plan, how digital marketing works
Digital Marketing Plan, how digital marketing works
Decoding Patterns: Customer Churn Prediction Data Analysis Project
Decoding Patterns: Customer Churn Prediction Data Analysis Project
Data Analysis Project: Stroke Prediction
Data Analysis Project: Stroke Prediction
INTRODUCTION TO Natural language processing
INTRODUCTION TO Natural language processing
SMOTE and K-Fold Cross Validation-Presentation.pptx
SMOTE and K-Fold Cross Validation-Presentation.pptx
Networking Case Study prepared by teacher.pptx
Networking Case Study prepared by teacher.pptx
Easter Eggs From Star Wars and in cars 1 and 2
Easter Eggs From Star Wars and in cars 1 and 2
8. Graph - Data Structures using C++ by Varsha Patil
1.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 1
2.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Graphs as one of the most important non-linear data structures The representation that models various kinds of graphs Some useful graph algorithms 2
3.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil A graph G is a discrete structure consisting of nodes (vertices) and the lines joining the nodes (edges) For finite graphs, V and E are finite. We can write a graph as G = (V, E) Graph traversals— Visiting all the vertices and edges in a systematic fashion is called as a graph traversal 3
4.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Graphs are classified as directed and undirected graphs In an undirected graph, an edge is a set of two vertices where order does not make any relevance, whereas in a directed graph, an edge is an ordered pair 4
5.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Graph 5 create() :Graph insert vertex(Graph, v) :Graph delete vertex(Graph, v) :Graph insert edge(Graph, u, v) :Graph delete edge(Graph, u, v) :Graph is empty(Graph) :Boolean; end graph
6.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Adjacency matrix (sequential representation) Adjacency list (linked representation) Adjacency Multilist Inverse Adjacency List 6 Representation of Graphs
7.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil The graphs represented using a sequential representation using matrices is called an adjacency matrix 7 Adjacency Matrix
8.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 8 Adjacency Matrix representation
9.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil In an adjacency list, the n rows of the adjacency list are represented as n-linked lists, one list per vertex of the graph We can represent G by an array Head, where Head[i] is a pointer to the adjacency list of vertex i Each node of the list has at least two fields: vertex and link The vertex field contains the vertex–id, and link field stores the pointer to the next node storing another vertex adjacent to i 9 Adjacency Lists
10.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 10
11.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 11
12.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 12 Multiclass are lists where nodes may be shared among several other lists
13.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil The node structure of such a list can be represented as follows : 13
14.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 14
15.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Inverse adjacency lists is a set of lists that contain one list for vertex Each list contains a node per vertex adjacent to the vertex it represents 15
16.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 16
17.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil DFS starts at the vertex v of G as a start vertex and v is marked as visited Then, each unvisited vertex adjacent to v is searched using the DFS recursively Once all the vertices that can be reached from v have been visited, the search of v is complete If some vertices remain unvisited, we select an unvisited vertex as a new start vertex and then repeat the process until all the vertices of G are marked visited 17
18.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 18 (a) Graph and its (b) adjacency list representation
19.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil A tree is a connected graph with no cycles A spanning tree is a sub-graph of G that has all vertices of G and is a tree A minimum spanning tree of a weighted graph G is the spanning tree of G whose edges sum to minimum weight 19
20.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil In BFS, all the unvisited vertices adjacent to i are visited after visiting the start vertex i and marking it visited Next, the unvisited vertices adjacent to these vertices are visited and so on until the entire graph has been traversed 20
21.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 21 Breadth-first search sequence for the graph
22.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil A tree is a connected graph with no cycles A spanning tree is a sub-graph of G that has all vertices of G and is a tree A minimum spanning tree of a weighted graph G is the spanning tree of G whose edges sum to minimum weight 22
23.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 23
24.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil An undirected graph is connected if there is at least one path between every pair of vertices in the graph A connected component of a graph is a maximal connected sub- graph, that is, every vertex in a connected component is reachable from the vertices in the component 24 Connected Components
25.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Following fig shows the Sample graph with one connected component 25
26.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Following fig shows the Graph with two connected components 26
27.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Prim’s algorithm starts from one vertex and grows the rest of the tree by adding one vertex at a time, by adding the associated edges This algorithm builds a tree by iteratively adding edges until a minimal spanning tree is obtained, that is, when all nodes are added At each iteration, it adds to the current tree a vertex though minimum weight edge that does not complete a cycle 27 Prim’s Algorithm
28.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 28 Minimum Spanning Tree Minimum Spanning Tree
29.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Another way to construct a minimum spanning tree for a graph G is to start with a graph T = (V′, E′ = ø) consisting of the n vertices of G and having no edges In Prim’s algorithm, we start with one connected component, add a vertex to have one connected component and no cycles, and end up with one connected component Here, we start with n connected components; at each step, the number of connected components would reduce by one and end up with one connected component 29 Kruskal’s Algorithm
30.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil The shortest path between two given vertices is the path having minimum length This problem can be solved by one of the greedy algorithms, by Edger W. Dijkstra, often called as Dijkstra’s algorithm 30 Shortest Path Algorithm
31.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil 31 Shortest Path Algorithm Directed weighted graph Shortest Path
32.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Graphs are one of the most important non-linear data structures. A graph is a representation of relation Vertices represent elements and edges represent relationships In other words, a graph is a collection of nodes (vertices) and arcs joining pair of the nodes (edges) Graphs are classified as directed and undirected graphs. In an undirected graph, an edge is a set of two vertices where order does not make any relevance, whereas in a directed graph, an edge is an ordered pair. 32 Summary
33.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil Graphs are implemented using an array or a linked list representation An adjacency list is a data structure for representing a graph by keeping a list of the neighbour vertices for each vertex An adjacency matrix is a data structure for representing a graph as a Boolean matrix where 0 means no edge and 1 corresponds to an edge A minimum spanning tree is a tree, containing all the vertices of a graph, where the total weight of the edges is minimum The two popularly used algorithms to compute minimum spanning tree are the following: Prim’s and Kruskal’s algorithms Dijkstra’s algorithm is another common algorithm for graphs to find the shortest path between two vertices of a graph 33 Summary
34.
Oxford University Press
© 2012Data Structures Using C++ by Dr Varsha Patil End of Chapter 8…! 34
Download now