Data.Graph.Types

newtype NodeId

Node identifier

Constructors

• NodeId String

Instances

• Eq NodeId
• Ord NodeId
• Show NodeId

type Edge = { from :: NodeId, to :: NodeId, weight :: Number }

Weighted edge

newtype EdgeId

Edge identifier (ordered pair of nodes)

Constructors

• EdgeId { from :: NodeId, to :: NodeId }

Instances

• Eq EdgeId
• Ord EdgeId
• Show EdgeId

newtype Graph

Graph with nodes and weighted edges Stored as adjacency list for efficient neighbor lookup

Constructors

• Graph { adjacency :: Map NodeId (Array { neighbor :: NodeId, weight :: Number }), edgeList :: Array Edge, nodeSet :: Array NodeId, positions :: Map NodeId { x :: Number, y :: Number } }

type Path = Array NodeId

A path is a sequence of nodes

mkGraph :: Array NodeId -> Array Edge -> Graph

Create a graph from nodes and edges

nodes :: Graph -> Array NodeId

Get all nodes

edges :: Graph -> Array Edge

Get all edges

neighbors :: NodeId -> Graph -> Array { neighbor :: NodeId, weight :: Number }

Get neighbors of a node with their edge weights

edgeWeight :: NodeId -> NodeId -> Graph -> Maybe Number

Get weight of a specific edge

updateWeight :: NodeId -> NodeId -> Number -> Graph -> Graph

Update the weight of an edge

nodePositions :: Graph -> Map NodeId { x :: Number, y :: Number }

Get/set node positions (for visualization)