Data Structures(Sequential Representation of Graphs)
Sequential Representation of Graphs:
1.Graphs can be represented through matrix in systems memory.
2.This is sequential in nature.
3.This type of representation is called sequential representation of graphs
4.Following are the types of sequential representation of graphs
a.Adjacent matrix representation
b.Path matrix representation
5.Adjacent matrix representation
a.The Adjacency matrix of a graph G with n vertices is N x N.
b.It is given by A=[aij].
aij=1 if ith and jth vertices are adjacent.
=0 if ith and jth vertices are not adjacent.
c.Example
Comments
Post a Comment