December 27, 2008
Excessive desire
— devadutta @ 11:51 pm, GMT +0000 ( 1230421915 ) 
Play
Play 1 discovered this algorithm first. 2 independently discovered it again 27 years later. 3 discovered it again 2 years later. Which?
1. 
2. 
3. 
Hint: Every guy who has got screwed for using goto statements in C/C++ will know 3.
Cracked by: sriram , username , Goyal. Very Nice!
Answer:
1. Vojtěch Jarník
2. Robert Prim
3. Edsger Dijkstra
The DJP algorithm – more famously known as the Prim’s Algorithm.
Subscribe
Play
Lite Version
December 28th, 2008 at 3:44 am, GMT +0000 ( 1230435896 )
1. Vojtěch Jarník
2. Robert Prim
3. Edsger Dijkstra
The DJP algorithm
December 28th, 2008 at 4:31 am, GMT +0000 ( 1230438719 )
3rd pic : Edsger Dijkstra
Reverse Polish notation
December 28th, 2008 at 7:26 am, GMT +0000 ( 1230449209 )
1. Jarnik Vojtech
2. Robert C. Prim
3. Edsger Dijkstra
Prim’s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. The algorithm was discovered in 1930 by mathematician Vojtěch Jarník and later independently by computer scientist Robert C. Prim in 1957 and rediscovered by Edsger Dijkstra in 1959.
http://en.wikipedia.org/wiki/Prim%27s_algorithm
December 28th, 2008 at 8:37 am, GMT +0000 ( 1230453439 )
Prim’s Algorithm
1. Vojtěch Jarník
2. Robert C. Prim
3. Edsger Dijkstra – A Case against the GO TO Statement
December 28th, 2008 at 9:20 am, GMT +0000 ( 1230456041 )
shortest path algorithm
December 28th, 2008 at 10:36 am, GMT +0000 ( 1230460580 )
1. Vojtěch Jarník
2. Robert C. Prim
3. Edsger Dijkstra
they all discovered the Min Spanning Tree algo
December 28th, 2008 at 6:22 pm, GMT +0000 ( 1230488537 )
Jarnik – Prim – Dijkstra – shortest path algorithm
December 28th, 2008 at 9:29 pm, GMT +0000 ( 1230499755 )
Shortest Path Algorithm