n edges shortest path

Hello list

Is there a well known algorithm that determines in an oriented graph
the shortest path using exactly n edges ?

.

Relevant Pages

  • Re: n edges shortest path
    ... > Is there a well known algorithm that determines in an oriented graph ... > the shortest path using exactly n edges? ... One algorithm I can think of would be adding another axis to ... Prev by Date: ...
    (comp.theory)
  • Re: Shortish paths
    ... For how many nodes and how many edges will the actual algorithm run ... original graph. ... optimal solution is removed from the graph, ... I intend to begin by rereading the shortest path sections of Cormen ...
    (comp.theory)
  • Re: which algorithm fits...
    ... >> for example, the 60th shortest path, that makes finding the right path ... >The most important thing that is still not known is how much memory you can ... >you can either do a depth first search, ... the algorithm appears to need some way to ...
    (comp.programming)
  • Re: Shortish paths
    ... Remember I'm not asking for an algorithm, just for advice on what to ... original graph. ... optimal solution is removed from the graph, ... I intend to begin by rereading the shortest path sections of Cormen ...
    (comp.theory)
  • Re: Shortish paths
    ... original graph. ... The functionality of Dijkstra's original algorithm can be extended ... optimal solution is removed from the graph, ... I intend to begin by rereading the shortest path sections of Cormen ...
    (comp.theory)