Page 1 of 1

MST !!!

Posted: Sun Mar 02, 2003 9:19 pm
by Moni
Which of the problems in the volumes can be solved by MST ? :roll:

Anyone who have followed this algorithm can you put a short tutorial on MST with the example with that solved problem ??? :-? :-? :-?

Posted: Tue Mar 04, 2003 1:24 pm
by Subeen
an easy problem that can be solved by MST is 10034.

there is two famous algorithm: 1. Kruskal, 2. Prim.
u can solve the problem using any one. (i tried prim)
it's easy, so u should code it by urself :)

and follow intro. to algo. (CLTR) for the algorithm or any other algo. book.

Posted: Sat Mar 15, 2003 7:53 pm
by kmhasan
These are the problems (from the volume) that I used MCST to solve:

10034 Freckles
10147 Highways
10307 Killing Aliens in Borg Maze
10369 Arctic Network
10397 Connect the Campus

If there are others please let me know. I'd like to re-use my code if I haven't tried it yet.

** I found 10307 and 10369 very interesting.

MST Problem

Posted: Mon Dec 08, 2003 11:46 pm
by rasel04
Another MST Problem of Archieve:

2515 - Networking

908

Posted: Tue Jul 03, 2007 2:57 pm
by soddy
908 is also MST problem

Posted: Fri Dec 21, 2007 8:05 pm
by Anindya
More MST problems:

10462
10600
10842

Posted: Fri Dec 21, 2007 8:07 pm
by Anindya
Another One:

11267