matrix

Question

gedas 0 Junior Poster

15 Years Ago

hey everyone i have a task to write down the adjacency matrix of this graph and im a little unsure how it should look
i hope there is someone that can help,
thx in advance:-/

c++

This attachment is potentially unsafe to open. It may be an executable that is capable of making changes to your file system, or it may require specific software to open. Use caution and only open this attachment if you are comfortable working with x-ms-bmp files.

untitled.bmp (256.43 KB)

2 Contributors
1 Reply
80 Views
9 Hours Discussion Span
Latest Post 15 Years Ago Latest Post by Lerner

Reply to this topic

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.

Lerner 582 Nearly a Posting Maven · Answer 1 · 2009-12-13T23:45:57+00:00

Googling leads me to believe that an adjacency matrix of a graph is an n by n matrix where n is the number of vertexes represented in the graph. The rows represent which vertex you are starting from. The columns represent which matrix you are going to. If you can get from one given vertex to another then the cell in the row representing the vertex you are starting from and the column where you are goint to has the value of one. If not the cell has a value of zero. Arrows represent you can go this direction, but not the the reverse.

The attached file has 6 vertexes. So the adjacency matrix for the graph would be 6 by 6. As I understand it the matrix itself would be:

011000
000011
000110
100000
000101
000000

In C++ this could be represented as 2 dimensional array of int.