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).

In directed graphs, relationships are asymmetric and these asymmetries contain essential structural information about the graph. Directed relationships lead to a new type of clustering that is not ...

Rigorous definitions for signed edges are provided. We describe cases in which intuition concerning signed edges fails and we characterize the directed acyclic graphs that researchers can use to draw ...