Explain the representations of graph.

The different ways of representing a graph is:

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

 

Posted Date: 5/10/2013 2:28:33 AM | Location : United States

Ask an Expert

Related Discussions:- Explain the representations of graph, Assignment Help, Ask Question on Explain the representations of graph, Get Answer, Expert's Help, Explain the representations of graph Discussions

Write discussion on Explain the representations of graph
Your posts are moderated

Write your message here..

Related Questions

Stack flowchart, example of stack using flowchart example of stack using flowchart

Draw the process flow diagram, Draw the process flow diagram: Anand   ... Draw the process flow diagram: Anand   Dairy (AD) sources 150,000 litres of milk daily from large number of local villagers .The milk is collected from 4:00 AM to 6:00 am and

Advanced data structures, In this unit, the following four advanced data st... In this unit, the following four advanced data structures have been practically emphasized. These may be considered as alternative to a height balanced tree, i.e., AVL tree.

Infix to postfix conversion, A*(B+D)/E-F*(G+H/K) A*(B+D)/E-F*(G+H/K)

Cohen sutherland algorithm, Using the cohen sutherland. Algorithm. Find the... Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Algorithms & flowchart, write an algorithm to find the average number of oc... write an algorithm to find the average number of occurances of MECHANIL in an english passage

Which sorting algorithms not have running time of o (n2), Which sorting al... Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

Write a program to create a heap file, Write a program to create a heap fil... Write a program to create a heap file that holds the records in the file " data_2013 " The source records are variablelength.However, the heap file should hold fixed-length reco

Convertion, how we can convert a graph into tree how we can convert a graph into tree

Endogenous model, Question a) Describe how the endogenous model is an ... Question a) Describe how the endogenous model is an improvement to the neo-classical model in explaining the long-run effect of investment on economic growth of a country.