Options
All
  • Public
  • Public/Protected
  • All
Menu

Class DGraph<T>

Type parameters

  • T

Hierarchy

  • DGraph

Implements

Index

Constructors

Properties

Accessors

Methods

Constructors

constructor

  • new DGraph(edges?: Iterable<Pair<T, Nullable<T>>>): DGraph

  • Parameters

    • Optional edges: Iterable<Pair<T, Nullable<T>>>

    Returns DGraph

Properties

dependencies

dependencies: EquivMap<T, ArraySet<T>>

dependents

dependents: EquivMap<T, ArraySet<T>>

Accessors

[Symbol.species]

  • get [Symbol.species](): DGraph

Methods

[Symbol.iterator]

  • [Symbol.iterator](): Generator<T, void, undefined>

  • Returns Generator<T, void, undefined>

addDependencies

  • addDependencies(node: T, deps: Iterable<T>): void

  • Parameters

    • node: T
    • deps: Iterable<T>

    Returns void

addDependency

  • addDependency(node: T, dep: T): this

  • Parameters

    • node: T
    • dep: T

    Returns this

addNode

  • addNode(node: T): this

copy

dependent

  • dependent(x: T, y: T): boolean

  • Parameters

    • x: T
    • y: T

    Returns boolean

depends

  • depends(x: T, y: T): boolean

  • Parameters

    • x: T
    • y: T

    Returns boolean

immediateDependencies

  • immediateDependencies(x: T): Set<T>

immediateDependents

  • immediateDependents(x: T): Set<T>

isLeaf

  • isLeaf(x: T): boolean

isRoot

  • isRoot(x: T): boolean

leaves

  • leaves(): IterableIterator<T>

nodes

  • nodes(): Set<T>

removeEdge

  • removeEdge(node: T, dep: T): this

  • Parameters

    • node: T
    • dep: T

    Returns this

removeNode

  • removeNode(x: T): this

roots

  • roots(): IterableIterator<T>

sort

  • sort(): T[]

transitiveDependencies

  • transitiveDependencies(x: T): Set<T>

transitiveDependents

  • transitiveDependents(x: T): Set<T>

Generated using TypeDoc