MST !!!

Moni · Post by **Moni** » Sun Mar 02, 2003 9:19 pm

Which of the problems in the volumes can be solved by MST ?

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

Subeen · Post by **Subeen** » Tue Mar 04, 2003 1:24 pm

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.

kmhasan · Post by **kmhasan** » Sat Mar 15, 2003 7:53 pm

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.

rasel04 · Post by **rasel04** » Mon Dec 08, 2003 11:46 pm

Another MST Problem of Archieve:

2515 - Networking

soddy · Post by **soddy** » Tue Jul 03, 2007 2:57 pm

908 is also MST problem

Anindya · Post by **Anindya** » Fri Dec 21, 2007 8:05 pm