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
Q. A linear array A is given with lower bound as 1. If address of A[25] is 375 and A[30] is 390, then find address of A[16].

Djikstra's algorithm (named after it is discovered by Dutch computer scientist E.W. Dijkstra) resolves the problem of finding the shortest path through a point in a graph (the sour

what are the applications of multikey file organization?

Almost Complete Binary Tree :-A binary tree of depth d is an almost whole binary tree if: 1.Any node and at level less than d-1 has two children. 2. for any node and in the tree wi

Elaborate the symbols of abstract data type length(a)-returns the number of characters in symbol a. capitalize(a)-returns the symbol generated from a by making its first cha

How divide and conquer technique can be applied to binary trees?  As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,

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


how we can convert a graph into tree

Explain process of B-TREE and what difference between AVL Tree Using Algorithms