Directed graphs

graph with oriented edges

directed graph with no directed cycles

subgraph of a directed graph containing paths in both directions between each pair of vertices

directed graph in which each pair of vertices are the endpoints of one edge

directed graph formed by reversing every edge of another directed graph

generalized directed graph which is permitted to have multiple arcs and loops

node-link graph representing overlaps between sequences of symbols

binary relation over nodes in a control-flow graph

a subset of the edges in a directed graph that includes at least one edge from each cycle

thumb|300px|There is a path (graph theory)|path directed from "s" to "t" in the first graph, but not in the second.

formula used in graph theory