Type parameters
T
Hierarchy
DGraph
Implements
Iterable
<
T
>
ICopy
<
DGraph
<
T
>
>
Index
Constructors
constructor
Properties
dependencies
dependents
Accessors
[
Symbol.species]
Methods
[
Symbol.iterator]
add
Dependencies
add
Dependency
add
Node
copy
dependent
depends
immediate
Dependencies
immediate
Dependents
is
Leaf
is
Root
leaves
nodes
remove
Edge
remove
Node
roots
sort
transitive
Dependencies
transitive
Dependents
Constructors
constructor
new DGraph<T>
(
edges
?:
Iterable
<
Pair
<
T
,
Nullable
<
T
>
>
>
)
:
DGraph
<
T
>
Type parameters
T
Parameters
Optional
edges:
Iterable
<
Pair
<
T
,
Nullable
<
T
>
>
>
Returns
DGraph
<
T
>
Properties
dependencies
dependencies
:
EquivMap
<
T
,
ArraySet
<
T
>
>
dependents
dependents
:
EquivMap
<
T
,
ArraySet
<
T
>
>
Accessors
[
Symbol.species]
get
[Symbol.species]
(
)
:
typeof
DGraph
Returns
typeof
DGraph
Methods
[
Symbol.iterator]
[
Symbol.iterator]
(
)
:
Generator
<
T
,
void
,
undefined
>
Returns
Generator
<
T
,
void
,
undefined
>
add
Dependencies
add
Dependencies
(
node
:
T
, deps
:
Iterable
<
T
>
)
:
void
Parameters
node:
T
deps:
Iterable
<
T
>
Returns
void
add
Dependency
add
Dependency
(
node
:
T
, dep
:
T
)
:
DGraph
<
T
>
Parameters
node:
T
dep:
T
Returns
DGraph
<
T
>
add
Node
add
Node
(
node
:
T
)
:
DGraph
<
T
>
Parameters
node:
T
Returns
DGraph
<
T
>
copy
copy
(
)
:
DGraph
<
T
>
Returns
DGraph
<
T
>
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
immediate
Dependencies
immediate
Dependencies
(
x
:
T
)
:
Set
<
T
>
Parameters
x:
T
Returns
Set
<
T
>
immediate
Dependents
immediate
Dependents
(
x
:
T
)
:
Set
<
T
>
Parameters
x:
T
Returns
Set
<
T
>
is
Leaf
is
Leaf
(
x
:
T
)
:
boolean
Parameters
x:
T
Returns
boolean
is
Root
is
Root
(
x
:
T
)
:
boolean
Parameters
x:
T
Returns
boolean
leaves
leaves
(
)
:
IterableIterator
<
T
>
Returns
IterableIterator
<
T
>
nodes
nodes
(
)
:
Set
<
T
>
Returns
Set
<
T
>
remove
Edge
remove
Edge
(
node
:
T
, dep
:
T
)
:
DGraph
<
T
>
Parameters
node:
T
dep:
T
Returns
DGraph
<
T
>
remove
Node
remove
Node
(
x
:
T
)
:
DGraph
<
T
>
Parameters
x:
T
Returns
DGraph
<
T
>
roots
roots
(
)
:
IterableIterator
<
T
>
Returns
IterableIterator
<
T
>
sort
sort
(
)
:
T
[]
Returns
T
[]
transitive
Dependencies
transitive
Dependencies
(
x
:
T
)
:
Set
<
T
>
Parameters
x:
T
Returns
Set
<
T
>
transitive
Dependents
transitive
Dependents
(
x
:
T
)
:
Set
<
T
>
Parameters
x:
T
Returns
Set
<
T
>
Exports
DGraph
constructor
dependencies
dependents
[
Symbol.species]
[
Symbol.iterator]
add
Dependencies
add
Dependency
add
Node
copy
dependent
depends
immediate
Dependencies
immediate
Dependents
is
Leaf
is
Root
leaves
nodes
remove
Edge
remove
Node
roots
sort
transitive
Dependencies
transitive
Dependents
defDGraph
Generated using
TypeDoc