objis a digraph and
digraph. If there is already an edge between the
target, no edge is added. If there is no node labeled
target, a node with that label is adjoined as well.
labeland edges from that node to the nodes labeled
digraph. If there is already a node
label, no node is added. If there is already an edge between the
labeland one of the
targets, that edge is not added. If there is no node labeled by one of
targets, a node with that label is adjoined as well.
predicatereturns a true value when invoked with the label and the nodes successor and predecessor sets as arguments, or the result of tail-calling
failurewith no arguments when there is none.
procfor each node of the
digraphwith three arguments: the label of the node, its successor set, its predecessor set, and an accumulated result of the previous invokation. For the first invokation,
nilis used as the last argument. Returns the result of the last invokation or
nilif there was no invokation.
digraph. Each association is a pair whose car is the label and whose cdr is a newly allocated list of the successors' labels of the node.
digraphusing the comparator
comparator, that has one node per association in
alist. Each association is a pair whose car is the label and whose cdr is a list of the successors' labels of the node.
digraph. Each strongly-connected component is a newly allocated list of the labels of the nodes belonging to that strongly-connected component.