What are the different ways by which we can represent graph?  Represent the graph drawn below using those ways.

 

 

The different ways by which we can representgraph are:

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

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 1:22:56 AM | Location : United States

Ask an Expert

Related Discussions:- Different ways for representing s graph, Assignment Help, Ask Question on Different ways for representing s graph, Get Answer, Expert's Help, Different ways for representing s graph Discussions

Write discussion on Different ways for representing s graph
Your posts are moderated

Write your message here..

Related Questions

Operations on b-trees, Operations on B-Trees Given are various operatio... Operations on B-Trees Given are various operations which can be performed on B-Trees: Search Create Insert B-Tree does effort to minimize disk access and t

C programming, bank database bank database

Explain optimal binary search trees, Explain Optimal Binary Search Trees ... Explain Optimal Binary Search Trees One of the principal application of Binary Search Tree is to execute the operation of searching. If probabilities of searching for elements

Progrrame, how to write a code for for a company , for calculate the salary... how to write a code for for a company , for calculate the salary pay

Graph, Multilist Representation of graph Multilist Representation of graph

Non-recursive algorithm, Q .  Write down the non-recursive algorithm to tra... Q .  Write down the non-recursive algorithm to traverse a tree in preorder. Ans: T he Non- Recursive algorithm for preorder traversal is written below: Initially i

Convert graph into tree, How can we convert a graph into a tree ? Do we hav... How can we convert a graph into a tree ? Do we have any standardized algorithm for doing this?

Algorithm and flow chart, algorithm and flow chart to find weather the give... algorithm and flow chart to find weather the given numbers are positive or negative or neutral

What is Polyphase Sort, One of the best known methods for external sorting ... One of the best known methods for external sorting on tapes is the polyphase sort. Principle: The basic strategy of this sort is to distribute ordered initial runs of predetermi

What is a spanning tree of a graph, What is a Spanning tree of a graph? ... What is a Spanning tree of a graph? A Spanning Tree is any tree having of vertices of graph tree and some edges of graph is known as a spanning tree.