package ocamlgraph
Depth-first search
iter pre post g
visits all nodes of g
in depth-first search, applying pre
to each visited node before its successors, and post
after them. Each node is visited exactly once.
Same thing, but for a single connected component
val has_cycle : t -> bool
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>