... >> Mathematics >> Discrete Mathematics >> Directed Graph
Highest Rated Sign
Nobody has posted a sign yet.
Definition: A directed graph is a pair (U,E) where U is a set of vertices (or nodes) and E is a set of edges over U, where an edge is an ordered pair of vertices. Essentially, E is a relation over U. Directed graphs are sometimes called digraphs.