Search
Preparing search index...
The search index is not available
tstruct
Options
All
Public
Public/Protected
All
Inherited
Externals
Only exported
Menu
Globals
"Graph/Graph"
IGraph
Interface IGraph<T>
Type parameters
T
Hierarchy
IGraph
Implemented by
Graph
Index
Methods
add
connect
connection
Exists
exists
get
Edges
get
Edges
For
get
Vertices
minimum
Spanning
Tree
shortest
Path
Methods
add
add
(
vertex
:
T
)
:
void
Parameters
vertex:
T
Returns
void
connect
connect
(
connection
:
Connection
<
T
>
)
:
void
Parameters
connection:
Connection
<
T
>
Returns
void
connection
Exists
connection
Exists
(
connection
:
Connection
<
T
>
)
:
boolean
Parameters
connection:
Connection
<
T
>
Returns
boolean
exists
exists
(
node
:
T
)
:
boolean
Parameters
node:
T
Returns
boolean
get
Edges
get
Edges
(
)
:
Connection
<
T
>
[]
Returns
Connection
<
T
>
[]
get
Edges
For
get
Edges
For
(
vertex
:
T
)
:
Connection
<
T
>
[]
Parameters
vertex:
T
Returns
Connection
<
T
>
[]
get
Vertices
get
Vertices
(
)
:
T
[]
Returns
T
[]
minimum
Spanning
Tree
minimum
Spanning
Tree
(
)
:
Graph
<
T
>
Returns
Graph
<
T
>
shortest
Path
shortest
Path
(
from
:
T
, to
:
T
)
:
T
[]
Parameters
from:
T
to:
T
Returns
T
[]
Globals
"
Binary
Tree/AVLTree"
"
Binary
Tree/
Binary
Search
Tree"
"
Binary
Tree/
Binary
Tree"
"
Common/
Common"
"
Compare
Function"
"
Graph/
Graph"
"
Heap/
Heap"
"
Linked
List/
Linked
List"
"
Queue/
Priority
Queue"
"
Queue/
Queue"
"
Sorting
Algorithms/
Sorting
Algorithms"
"
Stack/
Stack"
"
Trie/
Trie"
"
Union
Find/
Union
Find"
Graph
Connection
IGraph
add
connect
connection
Exists
exists
get
Edges
get
Edges
For
get
Vertices
minimum
Spanning
Tree
shortest
Path
Generated using
TypeDoc