Nop, the Prim's algorithm only gives the set with minimum weight of edges connecting all nodes.
Imagine this undirected graph:
A-B weight 2
B-C " 2
C-D " 2
A-D " 4
The shortest path from A to D is using the direct edge with cost 4, while the spawning tree uses...
Imagine a program that starts:
#include <linux.h>
...
It's obvious that it is not portable. You can't just compile the code on a different system (Windows, Mac, ...)
This is code portability. Most of the times its "solved" using conditional compiling like this:
#ifdef WIN32...
1st: madmike, why are you still using VB6?
2nd: stewartcs showed the solution. btw, to prevent Alt+F4 the KeyDown/KeyUp events should have an handler that cancels it. For the Ctrl+Alt+Del there's nothing you can do, unless you make your program a system service (Win 2k and above).