Data.Graph.Pathfinding

data PathResult

Result of pathfinding between two nodes

Constructors

• PathFound { cost :: Number, path :: Path }
• NoPath
• SameNode

type SearchResult = { distances :: Map NodeId Number, parents :: Map NodeId NodeId, visited :: Array NodeId }

Result of a graph search from a starting node Contains distances/depths and parent pointers for path reconstruction

dijkstra :: NodeId -> Graph -> SearchResult

Dijkstra's algorithm: find shortest paths from a source to all reachable nodes

Returns distances and parent pointers for path reconstruction.

let result = dijkstra (NodeId "A") graph
-- result.distances: Map from each node to its distance from A
-- result.parents: Map from each node to its parent in shortest path tree

shortestPath :: NodeId -> NodeId -> Graph -> PathResult

Find shortest path between two nodes using Dijkstra's algorithm

This is the main pathfinding function for weighted graphs.

findPath :: NodeId -> NodeId -> Graph -> PathResult

Alias for shortestPath (backwards compatibility with A* demo)

bfs :: NodeId -> Graph -> SearchResult

BFS from a starting node

Returns all reachable nodes with their depths and parent pointers. Useful for unweighted shortest paths.

dfs :: NodeId -> Graph -> SearchResult

DFS from a starting node

Returns all reachable nodes with discovery times and parent pointers.

bfsFrom :: NodeId -> Graph -> Array NodeId

BFS returning just the nodes in visit order

dfsFrom :: NodeId -> Graph -> Array NodeId

DFS returning just the nodes in visit order