Dijkstra Sourcecode2005-12-27

Sourcecode one of the most famous algorithms. It is looking for the shortest way in box tops from any before each summit. In this example, Earl kept in contiguity list, and search the minimum element organized binary heap. Heap approved by Minyaylov Vladimir - silver winner World Olympiad school programming in 2005, gold winner World Olympiad school programming in 2006.

Leave Comment

Nickname:
( Your nick or real name. Will be shown in comment's header )
E-Mail:
( Your e-mail. Used for connection with administration. Will NOT be shown )
Site, ICQ or Jabber:
( This field wil be shown in comment's header near your name )
Mark:
( How do you evaluate the material? By default assessment does not put )
Insert integer, shown on picture Image :
Comment's Text: