Q. Describe the representations of graph. Represent the graph which is given to us using any two methods

Ans:

The different ways by which we can represent graphs are:

Adjacency list representation: In this representation of graph there is an array Adj of |V| lists, one for each vertex in V. For each uεV, the adjacency list Adj[u] contains all the vertices v such that there is an edge (u,v)ε E that is Adj[u] consists of all the vertices adjacent to u in G. The vertices in each and every adjacency list are stored in an arbitrary order. The adjacency list representation of given graph is shown in the following figure:

Adjacency Matrix representation: This representation consists of the |V|*|V| matrix

A=(aij) such that

The adjacency matrix representation of given graph is as follows

Posted Date: 7/10/2012 3:18:02 AM | Location : United States

Ask an Expert

Related Discussions:- Reverse order of elements on a slack, Assignment Help, Ask Question on Reverse order of elements on a slack, Get Answer, Expert's Help, Reverse order of elements on a slack Discussions

Write discussion on Reverse order of elements on a slack
Your posts are moderated

Write your message here..

Related Questions

Define dynamic programming, Define Dynamic Programming  Dynamic  progra... Define Dynamic Programming  Dynamic  programming  is  a  method  for  solving  problems  with  overlapping  problems.  Typically, these sub problems arise from a recurrence rel

Implementation of stack, Before programming a problem solution those employ... Before programming a problem solution those employees a stack, we have to decide how to represent a stack by using the data structures which exist in our programming language. Stac

Find the adjacency matrix, Consider the digraph G with three vertices P1,P2... Consider the digraph G with three vertices P1,P2 and P3 and four directed edges, one each from P1 to P2, P1 to P3, P2 to P3 and P3 to P1. a. Sketch the digraph. b. Find the a

Need it urgently, Write an assembly program to separate the number of posit... Write an assembly program to separate the number of positive numbers and negative numbers from a given series of signed numbers.

#title.state charts., explain two strategies to implement state charts with... explain two strategies to implement state charts with the help of an example of each.

Green computing, In the present scenario of global warming, the computer ha... In the present scenario of global warming, the computer hard ware and software are also contributing for the increase in the temperature in the environment and contributing for the

Boundary tag method in context of dynamic memory management, Q. How can we ... Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?

..#title, whate is meant by the term heuristic whate is meant by the term heuristic

What is binary search, What is binary search?   Binary search is most ... What is binary search?   Binary search is most useful when list is sorted. In binary search, element present in middle of the list is determined. If key (the number to search)

Implement a min-heap, Description A heap is an efficient tree-based data... Description A heap is an efficient tree-based data structure that can be used as a priority queue. Recall that the abstract data type of a priority queue has the following opera