Hylograph.Data.Graph.Algorithms

type ReachabilityResult = { nodes :: Set NodeID, paths :: Array (Array NodeID), redundantEdges :: Array (Tuple NodeID NodeID), spanningTree :: Array (Tuple NodeID NodeID) }

Result of reachability analysis from a root node Includes all reachable nodes, the spanning tree edges, and any redundant (non-tree) edges

getReachableNodes :: forall node link. GraphConfig node link -> NodeID -> GraphModel node link -> ReachabilityResult

Compute all nodes reachable from a starting node via directed edges

This performs a breadth-first traversal, building a spanning tree of the reachable portion of the graph. Any edges that would create cycles are marked as redundant.

Example:

let result = getReachableNodes config rootId graph
-- result.nodes: Set of all reachable node IDs
-- result.spanningTree: Edges forming a tree
-- result.redundantEdges: Edges that create cycles

extractSpanningTree :: NodeID -> ReachabilityResult -> Tree NodeID

Extract a spanning tree from reachability analysis

Converts the spanning tree edges into a Tree structure rooted at the specified node.

depthFirstSearch :: forall node link. GraphConfig node link -> NodeID -> GraphModel node link -> (node -> Boolean) -> Array NodeID

Depth-first search traversal

Visits nodes in depth-first order, applying a predicate to decide whether to continue down each branch.

Returns nodes in the order they were visited.

breadthFirstSearch :: forall node link. GraphConfig node link -> NodeID -> GraphModel node link -> (node -> Boolean) -> Array NodeID

Breadth-first search traversal

Visits nodes level-by-level, applying a predicate to decide whether to continue exploring.

Returns nodes in the order they were discovered.