By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
424,963 Members | 1,751 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 424,963 IT Pros & Developers. It's quick & easy.

Questions on Prim's algorithm

P: n/a
I would like to know how the minimum spanning tree can be achieved in
this way, just a few explanation for guidance is ok:

In the following example, 999 represents they are not connected. There
are altogether 6 vertexes.

The adjacency matrix:
(0 2 999 3 999 999,
2 0 999 999 5 999,
999 999 0 1 999 999,
999 3 999 1 0 999 7,
999 5 999 999 0 4,
999 999 999 7 4 0)

The starting vertex:
0

Minimum spanning tree:
0 2 999 999 999 999
2 0 999 999 5 999
999 999 0 1 999 999
999 999 1 0 999 7
999 5 999 999 0 4
999 999 999 7 4 0

Apr 15 '06 #1
Share this Question
Share on Google+
1 Reply


P: n/a
"Jack" <s0*****@mailserv.cuhk.edu.hk> writes:
I would like to know how the minimum spanning tree can be achieved in
this way, just a few explanation for guidance is ok:

In the following example, 999 represents they are not connected. There
are altogether 6 vertexes.

The adjacency matrix:
(0 2 999 3 999 999,
2 0 999 999 5 999,
999 999 0 1 999 999,
999 3 999 1 0 999 7,
999 5 999 999 0 4,
999 999 999 7 4 0)

The starting vertex:
0

Minimum spanning tree:
0 2 999 999 999 999
2 0 999 999 5 999
999 999 0 1 999 999
999 999 1 0 999 7
999 5 999 999 0 4
999 999 999 7 4 0


That's not really a C question. Try comp.programming.

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.
Apr 15 '06 #2

This discussion thread is closed

Replies have been disabled for this discussion.