|
|||||||||
|
|||||||||
| |||||||||
|
|
|
|
|||||||||||||||||||||||||||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Display Modes |
Web Development Archives Sponsor:
|
|
|
|
#1
July 23rd, 2008, 07:01 AM
|
|||
|
|||
|
Shortest path with forced edges
Hi,
I want to find a shortest path in a graph. The path should pass a given set of "forced edges". The graph is undirected and complete. Edge weights are greater zero always. Does this problem have a special name I can use for googleing? Are there any known algorithms to solve the problem? Thanks, Rasmus --
|
|
| Viewing: Web Development Archives > FAQs > Research > Shortest path with forced edges |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
