Make adjacency matrix for un-directed graph, Data Structure & Algorithms

Q. Describe the adjacency matrix and make the same for the given undirected graph. 

2147_adjacency matrix.png

 

Ans:

The representation of Adjacency Matrix: This representation consists of |V|*|V| matrix

A=(aij) such as

1380_adjacency matrix1.png

The adjacency matrix of the given graph is shown below:

538_adjacency matrix2.png

Posted Date: 7/11/2012 1:47:27 AM | Location : United States







Related Discussions:- Make adjacency matrix for un-directed graph, Assignment Help, Ask Question on Make adjacency matrix for un-directed graph, Get Answer, Expert's Help, Make adjacency matrix for un-directed graph Discussions

Write discussion on Make adjacency matrix for un-directed graph
Your posts are moderated
Related Questions
differences between direct and indirect recursion

Advantages of First in First out (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

A queue is a, FIFO (First In First Out) list.

B Tree Unlike a binary-tree, every node of a B-tree may have a variable number of keys and children. The keys are stored in non-decreasing order. Every key has an associated ch

memory address of any element of lower left triangular sparse matrix

An undirected graph G with n vertices and e edges is shown by adjacency list.  What is the time required to generate all the connected components? O (e+n)

how to write an algorithm for unions & intersection of two linklists?

How to create an General Tree and how to search general tree?

We would like to implement a 2-4Tree containing distinct integer keys. This 2-4Tree is defined by the ArrayList Nodes of all the 2-4Nodes in the tree and the special 2-4Node Root w

Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }