Question about graph theroy--Help!

Hello everyone. I have a question about the graph theroy. The
Dijkstra's algorithm is to find the shortest path from source to
destination. If I want to find all the possible path from the source
to the destination, how should I do?

Thank you very much!

Bo
.

Relevant Pages

  • A* and multi-goals
    ... I am using A* to find the shortest path in a 3D environment, ... algorithm do the rest and my character simply follows the path. ... 'mandatory' nodes before reaching the final destination. ...
    (comp.ai.games)
  • Re: Question about graph theroy--Help!
    ... Dijkstra's algorithm is to find the shortest path from source to ... to the destination, how should I do? ... C'est suisse, et tres, tres precis." ...
    (comp.soft-sys.matlab)
  • Re: extracting inner key from a hash of hashes
    ... My actual goal is to find the shortest path between the source and the ... destination from the extracted information. ... Paul Lalli wrote: ...
    (comp.lang.perl.misc)
  • LAG - Which algorithm?
    ... I am new at using LAG and would like your opinion on which algorithm ... Destination IP Address ... the port is selected based on a hash of the ... destination IP address uses the same port in the link aggregation ...
    (Tru64-UNIX-Managers)
  • 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)