Graph - Data Structure and Algorithms
Graph is a non-linear Data Structure consisting of Nodes and Edges. The nodes are some times also referred as vertices and the edges are lines arcs that connect any to nodes in the graph.
A Graph of a finite vertices(nodes) and set of Edges which
connect a pair of Nodes.
Properties of Graph :
A Graph G can be represent as
G = ( V, E)
V : Finite and non empty set of vertices/nodes.
E : Set of pair of nodes/vertices it called edges.
- The node are adjacent if they are connected by an edge.
- A node's degree is the number of its edges.
- A Graph can be directed or indirect.
Representation of a Graph :
Graph can be represent by two method
- Adjacency matrix
- Adjacency list
Adjacency matrix :
Graph adjacency matrix representation is a process to show the graph connections or paths as a matrix.
Adjacency List :
Graph adjacency list representation is a process to show the graph connections or
paths as a list.
NOTE : If you fine any mistake or weakness in my article please help us to improve our content.
Top Posts :
Advantages of Object Oriented Programming
Object and Classes in C++
C++ Object Oriented Programming
