Maximal element
Give this one a try later!
No arrows leave the element (besides its own)
Transitive closure of G
, Give this one a try later!
G+
Given a directed graph G, the transitive closure is a new graph that shows
which vertices are reachable from others, either directly or through
intermediate vertices.
Topological sort
Give this one a try later!
Repeatedly chose vertices with 0 in-degrees; multiple can exist
circuit
Give this one a try later!
closed walk in which no edge occurs more than once
anti-symmetric binary relation
Give this one a try later!
no loops form between two elements
Give this one a try later!
No arrows leave the element (besides its own)
Transitive closure of G
, Give this one a try later!
G+
Given a directed graph G, the transitive closure is a new graph that shows
which vertices are reachable from others, either directly or through
intermediate vertices.
Topological sort
Give this one a try later!
Repeatedly chose vertices with 0 in-degrees; multiple can exist
circuit
Give this one a try later!
closed walk in which no edge occurs more than once
anti-symmetric binary relation
Give this one a try later!
no loops form between two elements
