Class DefaultGraphAlgorithms<Specifics>

Graph algorithms to do calculations on the type graph. All algorithms are robust regarding cycles.

Type Parameters

Specifics extends TypirSpecifics

Implements

GraphAlgorithms

Index

Constructors

Properties

Methods

collectReachableTypes existsEdgePath getEdgePath

Constructors

constructor

new DefaultGraphAlgorithms<Specifics extends TypirSpecifics>(
services: TypirServices<Specifics>,
): DefaultGraphAlgorithms<Specifics>
Type Parameters
- Specifics extends TypirSpecifics
Parameters
- services: TypirServices<Specifics>
Returns DefaultGraphAlgorithms<Specifics>
- Defined in graph/graph-algorithms.ts:25

Properties

`Protected` `Readonly`graph

graph: TypeGraph

Methods

collectReachableTypes

collectReachableTypes(
    from: Type,
    $relations: string[],
    filterEdges?: (edgr: TypeEdge) => boolean,
): Set<Type>
Parameters
- from: Type
- $relations: string[]
- OptionalfilterEdges: (edgr: TypeEdge) => boolean
Returns Set<Type>
Implementation of GraphAlgorithms.collectReachableTypes
- Defined in graph/graph-algorithms.ts:29

existsEdgePath

existsEdgePath(
    from: Type,
    to: Type,
    $relations: string[],
    filterEdges?: (edgr: TypeEdge) => boolean,
): boolean
Parameters
- from: Type
- to: Type
- $relations: string[]
- OptionalfilterEdges: (edgr: TypeEdge) => boolean
Returns boolean
Implementation of GraphAlgorithms.existsEdgePath
- Defined in graph/graph-algorithms.ts:51

getEdgePath

getEdgePath(
    from: Type,
    to: Type,
    $relations: string[],
    filterEdges?: (edgr: TypeEdge) => boolean,
): TypeEdge[]
Parameters
- from: Type
- to: Type
- $relations: string[]
- OptionalfilterEdges: (edgr: TypeEdge) => boolean
Returns TypeEdge[]
Implementation of GraphAlgorithms.getEdgePath
- Defined in graph/graph-algorithms.ts:84