|
2 | fixed ambiguity | ||
|
I came across this problem recently and I wanted to know whether it was a well known NP-complete problem. I checked the library but could not find anything that matched exactly. Given a directed weighted graph G. Find the shortest minimal weight path of length 'n' in the graph. Which is without setting any specific start node or end node. This is not my field, so you will pardon me if the solution is trivial. |
||||
|
|
1 |
|
||
Is this a well known NP-complete problem?I came across this problem recently and I wanted to know whether it was a well known NP-complete problem. I checked the library but could not find anything that matched exactly. Given a directed weighted graph G. Find the shortest path of length 'n' in the graph. Which is without setting any specific start node or end node. This is not my field, so you will pardon me if the solution is trivial.
|
||||
