Interface EdgeIndexedGraph<EdgeMap>

The minimum a graph has to offer for GraphDiff to compare its edges.

interface EdgeIndexedGraph<EdgeMap> {
edges(): Iterable<readonly [NodeId, EdgeMap]>;
hasVertex(id: NodeId): boolean;
}

Type Parameters

EdgeMap

Index

Methods

edges hasVertex

Methods

edges

edges(): Iterable<readonly [NodeId, EdgeMap]>
Returns Iterable<readonly [NodeId, EdgeMap]>
- Defined in src/util/diff-graph.ts:94

hasVertex

hasVertex(id: NodeId): boolean
Parameters
- id: NodeId
Returns boolean
- Defined in src/util/diff-graph.ts:95