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

Preliminaries, Think of a program you have used that is unacceptably slow. ... Think of a program you have used that is unacceptably slow. Identify the specific operations that make the program slow. Identify other basic operations that the program performs q

What is a data structure, Question 1 What is a data structure? Discuss bri... Question 1 What is a data structure? Discuss briefly on types of data structures Question 2 Explain the insertion and deletion operation of linked list in detail Question

Generate a single sorted list of all n elements, Q. Assume that we have sep... Q. Assume that we have separated n elements in to m sorted lists. Explain how to generate a single sorted list of all n elements in time O (n log m )?

Boundary tag system., boundary tag system in data structure? boundary tag system in data structure?

Algorithms, b) The user will roll two (six-sided) dices and the user will l... b) The user will roll two (six-sided) dices and the user will lose the game if (s)he gets a value 1 on either any of the two dices & wins otherwise. Display a message to the user w

Write an algorithm of value in tax using pseudocode, A town contains a tota... A town contains a total of 5000 houses. Every house owner has to pay tax based on value of the house. Houses over $200 000 pay 2% of their value in tax, houses over $100 000 pay 1.

Infix expression into the postfix expression, Q. Convert the given infix ex... Q. Convert the given infix expression into the postfix expression (also Show the steps) A ∗ (B + D)/ E - F(G + H / k ) Ans. Steps showing Infix to Post fix

Structures for complete undirected graphs, Q. Draw  the structures of compl... Q. Draw  the structures of complete  undirected  graphs  on  one,  two,  three,  four  and  five vertices also prove that the number of edges in an n vertex complete graph is n(n-1

The complexity of searching an element, The complexity of searching an elem... The complexity of searching an element from a set of n elements using Binary search algorithm is   O(log n)

Explain dijkstra''s algorithm, Explain Dijkstra's algorithm Dijkstra's ... Explain Dijkstra's algorithm Dijkstra's algorithm: This problem is concerned with finding the least cost path from an originating node in a weighted graph to a destination node