(graph theory: path problem)how to tell how many path are there from s to t in a graph?

From: Alfred Kerns (networm8848_at_yahoo.com)
Date: 04/06/04

  • Next message: Uffe Kousgaard: "Re: (graph theory: path problem)how to tell how many path are there from s to t in a graph?" 
    Date: 5 Apr 2004 21:12:53 -0700

    I wonder if the the Warshall's algorithm can be modified to give the
    number of paths between two nodes s and t in a given graph?

    How to do that?

    Thanks a lot,

    -Worm

  • Next message: Uffe Kousgaard: "Re: (graph theory: path problem)how to tell how many path are there from s to t in a graph?"