MutableGraph<N, E, T>Mutable graph interface.
When to use
Use when adding, removing, or updating nodes and edges inside a graph mutation scope.
Source effect/Graph.ts:1694 lines
export interface interface MutableGraph<out N, out E, T extends Kind = "directed">Mutable graph interface.
When to use
Use when adding, removing, or updating nodes and edges inside a graph
mutation scope.
MutableGraph<out function (type parameter) N in MutableGraph<out N, out E, T extends Kind = "directed">N, out function (type parameter) E in MutableGraph<out N, out E, T extends Kind = "directed">E, function (type parameter) T in MutableGraph<out N, out E, T extends Kind = "directed">T extends type Kind = "directed" | "undirected"Graph type for distinguishing directed and undirected graphs.
When to use
Use when writing graph-polymorphic types or helpers that need to preserve
whether a graph is directed or undirected.
Kind = "directed"> extends interface Proto<out N, out E>Common structural interface shared by immutable and mutable graphs.
Details
Contains the node and edge maps, adjacency indexes, allocation counters, and
shared protocols used by both Graph and MutableGraph.
Proto<function (type parameter) N in MutableGraph<out N, out E, T extends Kind = "directed">N, function (type parameter) E in MutableGraph<out N, out E, T extends Kind = "directed">E> {
readonly MutableGraph<out N, out E, T extends Kind = "directed">.type: T extends Kind = "directed"type: function (type parameter) T in MutableGraph<out N, out E, T extends Kind = "directed">T
readonly MutableGraph<out N, out E, T extends Kind = "directed">.mutable: truemutable: true
}Referenced by 49 symbols
Graph.MutableDirectedGraphGraph.MutableUndirectedGraphGraph.addEdgeGraph.addNodeGraph.astarGraph.beginMutationGraph.bellmanFordGraph.bfsGraph.connectedComponentsGraph.dfsGraph.dfsPostOrderGraph.dijkstraGraph.edgeCountGraph.edgesGraph.endMutationGraph.externalsGraph.filterEdgesGraph.filterMapEdgesGraph.filterMapNodesGraph.filterNodesGraph.findEdgeGraph.findEdgesGraph.findNodeGraph.findNodesGraph.floydWarshallGraph.getEdgeGraph.getNodeGraph.hasEdgeGraph.hasNodeGraph.isAcyclicGraph.isBipartiteGraph.mapEdgesGraph.mapNodesGraph.mutateGraph.neighborsGraph.neighborsDirectedGraph.nodeCountGraph.nodesGraph.predecessorsGraph.removeEdge+9 more