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

[HOWTO]

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.

[DOWNLOAD]

Shortest Path exec

26 Replies to “Dijkstra’s Shortest Path Calculator in PROLOG!”

      1. Hi good afternoon sir. Can you please send the source code because i really really need it for our project. Please sir

  1. hi

    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

  2. Fantastic g᧐ods from you, man. І have remember уoսr stuff previօus to and үοu’re simply too fantastic.
    I аctually ⅼike whɑt yߋu’ve oЬtained riցht here, realⅼy like what you’re stating аnd the way in which іn which you say it.
    You aге making it entertaining and үou ѕtіll tɑke care ߋf tо ҝeep it sensible.
    I cɑnt wai to read far more fdom y᧐u. This is actuаlly a terrific web site.

Leave a Reply

Your email address will not be published. Required fields are marked *


*