LabVIEW

cancel
Showing results for 
Search instead for 
Did you mean: 

dijkstra's algorithm

Hey folks,

 

I am working on a dijkstra's algorithm program.  So far my program follows the shortest route and tells me the distance.  However,  I am not sure how I would go about finding the path that it took with the way I have the program set up.   I am fairly certain my program finds the shortest route,  have ran it numerous times and have been able to verify.  If anyone could help it would be much appreciated. 

0 Kudos
Message 1 of 3
(2,639 Views)

I realized one of my errors in the system.  It could visit the same node more than once.  I believe I have fixed that.

0 Kudos
Message 2 of 3
(2,630 Views)

Can you post 2010 version ? I can try Smiley Tongue

-------------------------------------------------------------------------------------------------------------------------------
Thanks & Regards,
Kunal Raithatha.
CTD - CLAD (I wish I can take off that A, and maybe use it later to replace D 🙂

Easy Tip :- "To copy an image to a VI icon, drag the image file and place it on the icon
located in the upper right corner of the front panel or block diagram" ...If you know any
more reply back.
-------------------------------------------------------------------------------------------------------------------------------
0 Kudos
Message 3 of 3
(2,624 Views)