• a directed graph (digraph) is a graph whose all edges are directed
  • the in-degree of a vertex is the number of edges pointing to the vertex
  • the out-degree of a vertex is the number of edges pointing away from the vertex

Reachability

Strong Connectivity

Transitive Closure

Floyd-Warshall

Topological Ordering