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
one to many one to one many to many many to one

Which sorting algorithm is easily adaptable to singly linked lists? Simple Insertion sor t is easily adabtable to singly linked list.


Compare zero-address, one-address, two-address, and three-address machines by writing programs to compute: Y = (A – B X C) / (D + E X F) for each of the four machines. The inst

write a COBOL program to find the biggest of two numbers

Program: Creation of a Circular linked list ALGORITHM (Insertion of an element into a Circular Linked List) Step 1        Begin Step 2      if the list is empty or new

2. Write a note on i) devising ii) validating and iii) testing of algorithms.

What do you mean by complexity of an algorithm? The complexity of an algorithm M is the function f(n) which gives the running time and/or storage space need of the algorithm i

Two broad classes of collision resolution techniques are A) open addressing and B) chaining

Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.