Skip to content

IDirectedGraph

Defined in: packages/data/src/graph/idirected-graph.ts:6

A directed graph, additionally distinguishing in- and out-neighbors.

N

E extends DefinedValue | void = void

addEdge(from, to, label): void

Defined in: packages/data/src/graph/igraph.ts:19

N

N

E

void

IGraph.addEdge


addNode(node): void

Defined in: packages/data/src/graph/igraph.ts:13

N

void

IGraph.addNode


addNodes(nodes): void

Defined in: packages/data/src/graph/igraph.ts:14

Iterable<N>

void

IGraph.addNodes


degree(node): number

Defined in: packages/data/src/graph/igraph.ts:26

N

number

IGraph.degree


deleteEdge(from, to): boolean

Defined in: packages/data/src/graph/igraph.ts:20

N

N

boolean

IGraph.deleteEdge


deleteNode(node): boolean

Defined in: packages/data/src/graph/igraph.ts:15

N

boolean

IGraph.deleteNode


edgeCount(): number

Defined in: packages/data/src/graph/igraph.ts:12

number

IGraph.edgeCount


edgeLabel(from, to): E | undefined

Defined in: packages/data/src/graph/igraph.ts:22

N

N

E | undefined

IGraph.edgeLabel


edges(): IterableIterator<readonly [N, N, E]>

Defined in: packages/data/src/graph/igraph.ts:23

IterableIterator<readonly [N, N, E]>

IGraph.edges


hasEdge(from, to): boolean

Defined in: packages/data/src/graph/igraph.ts:21

N

N

boolean

IGraph.hasEdge


hasNode(node): boolean

Defined in: packages/data/src/graph/igraph.ts:16

N

boolean

IGraph.hasNode


inDegree(node): number

Defined in: packages/data/src/graph/idirected-graph.ts:12

N

number


inNeighbors(node): IterableIterator<N>

Defined in: packages/data/src/graph/idirected-graph.ts:10

N

IterableIterator<N>


neighbors(node): IterableIterator<N>

Defined in: packages/data/src/graph/igraph.ts:25

N

IterableIterator<N>

IGraph.neighbors


nodeCount(): number

Defined in: packages/data/src/graph/igraph.ts:11

number

IGraph.nodeCount


nodes(): IterableIterator<N>

Defined in: packages/data/src/graph/igraph.ts:17

IterableIterator<N>

IGraph.nodes


outDegree(node): number

Defined in: packages/data/src/graph/idirected-graph.ts:13

N

number


outNeighbors(node): IterableIterator<N>

Defined in: packages/data/src/graph/idirected-graph.ts:11

N

IterableIterator<N>