Explain the representations of graph, Data Structure & Algorithms

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







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
Related Questions
Example of pre order traversal: Reading of a book, since we do not read next chapter unless we complete all sections of previous chapter & all its sections. Figure  : Rea

Example which cause problems for some hidden-surface algorithms Some special cases, which cause problems for some hidden-surface algorithms, are penetrating faces and cyclic ov

As part of an experiment, a school measured heights (in metres) of all its 500 students. Write an algorithm, using a flowchart that inputs the heights of all 500 students and ou

algorithm for multiplication of two sparse matrices using linked lists..

circular queue using c

Conceptually, the stack abstract data type mimics the information kept into a pile on a desk. Informally, first we consider a material on a desk, where we might keep separate stack

explain quick sort algorithm

two standards ways of traversing a graph in data structure

What are the expression trees? Represent the below written expression using a tree. Give a relevant comment on the result that you get when this tree is traversed in Preorder,

Double Linked List In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of t