top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

How to find shortest path in a multistage graph using dynamic programming?

+3 votes
1,632 views

How to find shortest path in a multistage graph using dynamic programming, C/C++ code would be helpful?

posted Mar 8, 2016 by anonymous

Looking for an answer?  Promote on:
Facebook Share Button Twitter Share Button LinkedIn Share Button

Similar Questions
+2 votes
How to implement a C / C++ program for Dijkstra's shortest path algorithm.

using adjacency matrix representation of graph?

+5 votes
How to find nodes in a tree which has longest path? 
      40
      /\
     20 60
     /\  \
   10 30  80
      /   /\
     25  70 90
           \
           75

longest path 
25 30 20 40 60 80 70 75 
Answer
    25 ----> 75
0 votes
Given a graph, find the number of shortest paths present between source and destination?

Given a graph and a source node and destination node, find the number of shortest paths present between source and destination?

+7 votes
Find the path with least sum between two zeros in a matrix?

You have a 2D matrix. Only two ZEROs in matrix.
Find the path from 1st zero to 2nd zero with least sum.

1       6       8       9       0       3

4       9       -5      5       11      13

8       9       44      23      15      -20

7       9       7       -13     14      11      

0       16      23      31      16      7

67      5       4       23      21      19

Answer

1       6       8       9       0  ----> 3
                                         |
4       9       -5      5       11      13
                                         |
8       9       44      23      15      -20
                                         |
7 <---- 9 <---- 7 <--- -13 <--- 14 <---  11     
|
0       16      23      31      16        7

67      5       4       23      21       19
...