toggle menu
kotlin-stdlib-project
0.1.0-SNAPSHOT
common
switch theme
search in API
kotlin-stdlib
/
com.javiersc.kotlin.stdlib.graph
/
MutableGraph
Mutable
Graph
class
MutableGraph
<
T
>
:
Graph
<
T
>
Members
Properties
circular
Vertexes
Link copied to clipboard
open
val
circularVertexes
:
Map
<
T
,
List
<
T
>
>
duplicated
Vertexes
Link copied to clipboard
open
val
duplicatedVertexes
:
Map
<
T
,
Int
>
entries
Link copied to clipboard
open
override
val
entries
:
Set
<
Map.Entry
<
Graph.Vertex
<
T
>
,
List
<
Graph.Edge
<
T
>
>
>
>
has
Circular
Vertexes
Link copied to clipboard
open
val
hasCircularVertexes
:
Boolean
has
Duplicated
Vertexes
Link copied to clipboard
open
val
hasDuplicatedVertexes
:
Boolean
has
Missing
Vertexes
Link copied to clipboard
open
val
hasMissingVertexes
:
Boolean
keys
Link copied to clipboard
open
override
val
keys
:
Set
<
Graph.Vertex
<
T
>
>
missing
Vertexes
Link copied to clipboard
open
override
val
missingVertexes
:
Set
<
T
>
renderer
Link copied to clipboard
open
override
var
renderer
:
Any
?
.
(
)
->
String
size
Link copied to clipboard
open
override
val
size
:
Int
values
Link copied to clipboard
open
override
val
values
:
Collection
<
List
<
Graph.Edge
<
T
>
>
>
Functions
add
Edge
Link copied to clipboard
fun
addEdge
(
source
:
T
,
destination
:
T
)
add
Vertex
Link copied to clipboard
fun
addVertex
(
data
:
T
)
:
T
as
String
Link copied to clipboard
open
fun
asString
(
)
:
String
contains
Link copied to clipboard
open
fun
contains
(
value
:
T
)
:
Boolean
open
fun
contains
(
value
:
T
,
predicate
:
(
T
)
->
Boolean
)
:
Boolean
contains
Circular
Vertexes
Link copied to clipboard
open
fun
containsCircularVertexes
(
value
:
T
)
:
Boolean
contains
Key
Link copied to clipboard
open
override
fun
containsKey
(
key
:
Graph.Vertex
<
T
>
)
:
Boolean
contains
Value
Link copied to clipboard
open
override
fun
containsValue
(
value
:
List
<
Graph.Edge
<
T
>
>
)
:
Boolean
does
Not
Contains
Circular
Vertexes
Link copied to clipboard
open
fun
doesNotContainsCircularVertexes
(
value
:
T
)
:
Boolean
get
Link copied to clipboard
open
operator override
fun
get
(
key
:
Graph.Vertex
<
T
>
)
:
List
<
Graph.Edge
<
T
>
>
?
is
Empty
Link copied to clipboard
open
override
fun
isEmpty
(
)
:
Boolean
renderer
Link copied to clipboard
open
fun
renderer
(
block
:
Any
?
.
(
)
->
String
)
to
Graph
Link copied to clipboard
open
fun
toGraph
(
)
:
Graph
<
T
>
to
Graph
Sorted
By
Edges
Link copied to clipboard
open
fun
toGraphSortedByEdges
(
)
:
Graph
<
T
>
to
String
Link copied to clipboard
open
override
fun
toString
(
)
:
String
vertexes
For
Link copied to clipboard
open
fun
vertexesFor
(
vararg
values
:
T
)
:
List
<
T
>
open
fun
vertexesFor
(
value
:
T
,
predicate
:
(
T
)
->
Boolean
=
{ it == value }
)
:
List
<
T
>