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
1. In computer science, a classic problem is how to dynamically store information so as to let for quick look up. This searching problem arises frequently in dictionaries, symbol t

In order to get the contents of a Binary search tree in ascending order, one has to traverse it in In-order

#What is the pointer

Example: Assume the following of code: x = 4y + 3 z = z + 1 p = 1 As we have been seen, x, y, z and p are all scalar variables & the running time is constant irrespective

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Data Structure and Methods: Build an array structure to accomodate at least 10 elements. Provide routines for the following: An initializer. A routine to populate (

Document processing is quickly becoming one of the dominant functions of computers. Computers are utilized to edit, search & transport documents over the Internet, and to display d

Explain the theory of computational complexity A  problem's  intractability  remains  the  similar  for  all  principal  models  of   computations    and   all reasonable inpu

A shop sells books, magazines and maps. Every item is identified by a unique 4 - digit code. All books have a code which starts with 1, all maps have a code starting with 2 and all

Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr