Index
Modules:
gram.
API symbols
- `$`:
- `[]`:
- gram: `[]`[N, E; F: static[GraphFlags]](graph: Graph[N, E, F]; key: N): Node[N, E]
- gram: `[]`[N, E; F: static[GraphFlags]](graph: var Graph[N, E, F]; key: N): var Node[
N, E]
- gram: `[]`[N, E](node: var Node[N, E]; key: E): var Node[N, E]
- gram: `[]`[N, E](node: Node[N, E]; key: E): Node[N, E]
- add:
- clear:
- contains:
- gram: contains[N, E](edge: Edge[N, E]; value: N): bool
- gram: contains[N, E](edge: Edge[N, E]; node: Node[N, E]): bool
- gram: contains[N, E; F: static[GraphFlags]](graph: Graph[N, E, F]; edge: Edge[N, E]): bool
- gram: contains[N, E; F: static[GraphFlags]](graph: Graph[N, E, F]; value: N): bool
- gram: contains[N, E; F: static[GraphFlags]](graph: Graph[N, E, F]; node: Node[N, E]): bool
- gram: contains[N, E](node: Node[N, E]; key: E): bool
- gram: contains[N, E](node: Node[N, E]; edge: Edge[N, E]): bool
- defaultGraphFlags:
- del:
- Edge:
- edge:
- gram: edge[N, E; F: static[GraphFlags]](graph: var Graph[N, E, F];
node: var Node[N, E]; value: E;
target: var Node[N, E]): Edge[N, E]
- gram: edge[N, E; F: static[GraphFlags]](graph: var Graph[N, E, F]; node: Node[N, E];
value: E; target: Node[N, E]): Edge[N, E]
- EdgeResult:
- edges:
- flags:
- Graph:
- GraphFlag:
- GraphFlags:
- hash:
- incl:
- incoming:
- gram: incoming[N, E](node: var Node[N, E]): tuple[edge: var Edge[N, E],
source: var Node[N, E]]
- gram: incoming[N, E](node: Node[N, E]): tuple[edge: Edge[N, E], source: Node[N, E]]
- init:
- items:
- len:
- neighbors:
- newContainer:
- newGraph:
- Node:
- node:
- nodes:
- nodesAreUnique:
- NoValueIndexGraph:
- outgoing:
- gram: outgoing[N, E](node: var Node[N, E]): tuple[edge: var Edge[N, E],
target: var Node[N, E]]
- gram: outgoing[N, E](node: Node[N, E]): tuple[edge: Edge[N, E], target: Node[N, E]]
- peers:
- toFlags:
- toInt:
- ValueIndexGraph:
Made with Nim. Generated: 2022-10-13 16:50:59 UTC