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
The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le

In the book the following methods are presented: static void selectionSort(Comparable[] list) static void insertionSort(Comparable[] list) static boolean linearSearch(Comparable

A LGORITHM (Deletion of an element from the linked list) Step 1  Begin Step 2  if the list is empty, then element cannot be deleted Step 3  else, if the element to be del

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

what do we use asymptotic notation in study of algorithm?Describe various asymptotic notation and give their significance.

Determine about the logic gates Many electronic circuits operate using binary logic gates. Logic gates essentially process signals that represent true or false or equivalent i.

i need the full concept of it... please can anyone provide

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

Explain the Memory Function method The Memory Function method seeks to combine strengths of the top  down and bottom-up approaches  to  solving  problems  with  overlapping  su

In this sorting algorithm, multiple swapping occurs in one pass. Smaller elements move or 'bubble' up to the top of the list, so the name given to the algorithm. In this method,