Creates an empty navigation graph.
Graph identifier, generated automatically when omitted.
ReadonlyedgesEdges indexed by their identifiers.
ReadonlyidGraph identifier, generated automatically when omitted.
ReadonlynodesNodes indexed by their identifiers.
Static ReadonlyformatCurrent JSON serialization format version.
Adds an edge between two existing nodes.
Identifier of the edge's source node.
Identifier of the edge's target node.
Optional identifier and initial edge state.
The created edge.
Adds a node to the graph.
Node position in world coordinates.
Optional identifier and initial node state.
The created node.
Creates an independent deep copy of this graph.
Deletes the connected component containing the supplied node or edge.
Deletes an edge and removes it from both endpoint nodes.
Finds the edge connecting two nodes, regardless of its direction.
Returns every node in the connected component containing the supplied node or edge.
Combines nodes into the first node while preserving their external connections.
Identifiers of at least two nodes to merge.
How to choose the merged node position.
The surviving node.
Moves a node and records whether its new position is geometrically valid.
Returns an edge or throws when its identifier is absent.
Returns a node or throws when its identifier is absent.
Exchanges an edge's source and target nodes.
Collects structural errors and errors derived from the current geometry validity states.
A graph of nodes and edges describing the walkable paths of a scene, used to compute navigation routes between two points.