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. Write down the recursive function to count the number of the nodes in the binary tree.    A n s . R ecursive Function to count no. of Nodes in Binary Tree is writt

important points on asymptotic notation to remember

Representation of Linked list in Memory:- Each node has an info part and a pointer to the next node also known as link. The number of pointers is two in case of doubly linked

what do you understand by structured programming?explain with eg. top down and bottem up programming technique

Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but

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.

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

HLS Colour Model  This model has the double-cone representation shown in Figure 3.40. The three colour parameters in this model are called hue (H), lightness (L), and Saturati

Double Linked List In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of t

How to create multiple queue on single array?