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

Stickly binary tree, stickly binary tree stickly binary tree

State the example of pre- and post-conditions, State the example of pre- an... State the example of pre- and post-conditions Suppose that function f(x) should have a non-zero argument and return a positive value. We can document these pre- and post-condit

Explain best - fit method, Best - Fit Method: - This method obtains the sma... Best - Fit Method: - This method obtains the smallest free block whose  size is greater than or equal to get such a block by traversing the whole free list follows.

Hw7, Handout 15 COMP 264: Introduction to Computer Systems (Section 001) Sp... Handout 15 COMP 264: Introduction to Computer Systems (Section 001) Spring 2013 R. I. Greenberg Computer Science Department Loyola University Water TowerCampus, Lewis Towers 524 82

B-tree of minimum degree t can maximum pointers in a node, A B-tree of mini... A B-tree of minimum degree t can maximum pointers in a node T pointers in a node.

What is class invariants assertion, What is Class invariants assertion ... What is Class invariants assertion A class invariant is an assertion which should be true of any class instance before and after calls of its exported operations. Generally

Write the algorithm to find input and output value, This algorithm inputs 5... This algorithm inputs 5 values and outputs how many input numbers were positive and how many were negative. Data to be used: N = 1, -5, 2, -8, -7

Determine relevancy and relative position of two polygons, Comparison Techn... Comparison Techniques There are several techniques for determining the relevancy and relative position of two polygons. Not all tests may be used with all hidden-surface algori

Files structures, The structures of files vary from operating system to ope... The structures of files vary from operating system to operating system. In this unit, we will discuss the fundamentals of file structures with the generic file organisations. A

Frequency count, i:=1 while(i { x:=x+1; i:=i+1; } i:=1 while(i { x:=x+1; i:=i+1; }