Using this definition of path, OP, you must realize that there may be exponentially (in the number of vertices + edges in the graph) many paths between two vertices (even in simple graphs).

Shortest Path: The most efficient route between two vertices in a graph, minimising distance, cost or time. Node Cut Set: A subset of vertices whose removal disconnects the graph, used to simplify ...

Karl Rohe, Tai Qin, Bin Yu, Co-clustering directed graphs to discover asymmetries and directional communities, Proceedings of the National Academy of Sciences of the United States of America, Vol. 113 ...

Recent epidemiological studies have increasingly used graphical tools for causal inference. 12 Directed acyclic graphs (DAGs) are valuable in visualizing relationships among variables and representing ...