Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!cbnewsm!cbnewsk!lor
From: lor@cbnewsk.att.com (edward.lor)
Newsgroups: comp.theory
Subject: K shortest paths
Message-ID: <1991Apr19.002449.28518@cbnewsk.att.com>
Date: 19 Apr 91 00:24:49 GMT
Organization: AT&T Bell Laboratories
Lines: 14


Are there any established algorithms to find the k (k>1) shortest paths 
between two nodes in a graph?

When k=1, there are numerous algorithms to the problem (Dijkstra's, 
breadth-first, etc.), but I can't find any materials in finding k paths
in most of the graph theory books.

Any pointer is appreciated.

-- 
                                          Edward Lor
                                          lor@cbnewsk.att.com