MathGroup Archive 1996

[Date Index] [Thread Index] [Author Index]

Search the Archive

Path find algorithm for undirected graph


This perhaps is not the right place to post this message. If you know a 
more appropriate place, please let me know.

I try to find an algorithm to find all possible simple paths between two
end nodes in a graph. The graph is a mixture of directed and undirected 
graph. Could this be done? How about for pure undirected graph?

I know this could be done in directed graph, but I am sure for undirected
graph. If it could be done, please give me some hint about where I could find
the algorithm.

Thanks

Bing Zhang

Dept. of Computer Engineering
Dept. of Mechanical Engineering
University of Southern California

(213) 267-4481

==== [MESSAGE SEPARATOR] ====


  • Prev by Date: Exceptions handling
  • Next by Date: Path find algorithm for undirected graph
  • Previous by thread: Exceptions handling
  • Next by thread: Path find algorithm for undirected graph