Enumeration of success paths in a graph

Abstract A computer program for the enumeration of all success paths between a specified pair of nodes in a probablistic non-oriented graph is described. It can be easily adapted for use with oriented graphs.