• About
  • Archives
  • Categories
  • Dijkstra’s Shortest Path Calculator in PROLOG!

    2010 - 06.03

    A Shortest Path Calculator for undirected graphs using Dijkstra’s shortest path algorithm in PROLOG


    1- Use left mouse clicks to draw as many nodes.

    2- Use your left mouse button to choose the start node, then the right one on the destination node to draw an edge

    NB. You should specify the weight before drawing the edge

    3- After drawing your graph, you’ll need to choose your destination node using your right mouse button.

    NB. Your start node will be always node ‘a’

    4- Click on Calculate Shortest Path button.


    Shortest Path exec

    Tags: ,

    38 Responses to “Dijkstra’s Shortest Path Calculator in PROLOG!”

    1. Rana says:

      It’s really fantastic and impressed me so much !

    2. Sachin says:


      I download the sample but it is corrupted. Please upload the fresh copy of the same.

    3. Riku says:

      Where’s the source code? Posting windows-only executables is sooo 1990’s.

    4. Alex says:

      Could have been any language if you’re only providing an executable.
      Please share the source.

    5. tammylleanne says:
    6. tammylleanne says:
    7. hadi ranji says:


      i perform to project i need to learn some project
      can you give me source project ?

      i only need drawing node cirlce and link weight

    8. lavendarlin says:

      hi.. can you please share me your source code.. how to generate the shortest path

    9. Superb post however , I was wondering if you could write a litte more on this topic?
      I’d be very thankful if you could elaborate a little bit further.
      Many thanks!

    10. Free theme says:

      Unquestionably believe that which you said. Your favorite justification seemed to
      be on the web the simplest thing to be aware of.

      I say to you, I definitely get annoyed while people
      think about worries that they just don’t know about. You managed to hit
      the nail upon the top and also defined out the
      whole thing without having side-effects , people can take a signal.
      Will likely be back to get more. Thanks

    11. Thanks , I have recently been searching for info about this subject for a while
      and yours is the best I have found out so far. But,
      what concerning the bottom line? Are you positive concerning the source?

    12. Aw, this was a very nice post. Taking the time and actual effort to
      make a very good article… but what can I
      say… I procrastinate a lot and never seem to
      get nearly anything done.

    13. Greetings from Carolina! I’m bored to tears at work so I decided to browse your website
      on my iphone during lunch break. I love the information you provide here and
      can’t wait to take a look when I get home. I’m surprised at how fast your
      blog loaded on my phone .. I’m not even using WIFI,
      just 3G .. Anyhow, awesome blog!

    14. WOW just what I wass searching for. Came here by searching for shady

    15. hello!,I love your writing very much! proportion we keep in touch extra about
      your post on AOL? I require a specialist on this space to unravel my problem.
      Maybe that is you! Taking a look forward to peer you.

    Your Reply