An algorithm to find all paths between two nodes in a graph (Q916679)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An algorithm to find all paths between two nodes in a graph
scientific article

    Statements

    An algorithm to find all paths between two nodes in a graph (English)
    0 references
    1990
    0 references
    In this note the authors present an algorithm for finding all the paths between two nodes in a graph. The algorithm is a well-known application of the depth-first search strategy and the authors report on some simulations they performed (on aqueous systems) using several kinds of computer systems.
    0 references
    algorithm
    0 references
    finding all the paths between two nodes in a graph
    0 references
    simulations
    0 references
    0 references
    0 references

    Identifiers