and 3 others joined a min ago.
0
30kviews
Write a short note on Multistage graphs
1 Answer
3
863views
written 8.8 years ago by
teamques10
★ 70k
|
A multistage graph G=(V,E) which is a directed graph. In this graph all the vertices are partitioned into the k stages where k>=2.
In multistage graph problem we have to find the shortest path from source to sink.
The cost of a path from source (denoted by S) to sink …
and 4 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.