kotlin-stdlib/com.javiersc.kotlin.stdlib.graph/Graph

Graph

interface Graph<T> : Map<Graph.Vertex<T>, List<Graph.Edge<T>>>

Inheritors

MutableGraph

Types

Edge

data class Edge<T>(val source: Graph.Vertex<T>, val destination: Graph.Vertex<T>)

Vertex

data class Vertex<T>(val index: Int, val value: T)

Properties

circularVertexes

open val circularVertexes: Map<T, List<Graph.Edge<T>>>

duplicatedVertexes

open val duplicatedVertexes: Map<T, Int>

entries

abstract val entries: Set<Map.Entry<Graph.Vertex<T>, List<Graph.Edge<T>>>>

hasCircularVertexes

open val hasCircularVertexes: Boolean

hasDuplicatedVertexes

open val hasDuplicatedVertexes: Boolean

hasMissingVertexes

open val hasMissingVertexes: Boolean

keys

abstract val keys: Set<Graph.Vertex<T>>

missingVertexes

abstract val missingVertexes: Set<T>

renderer

abstract var renderer: Any?.() -> String

size

abstract val size: Int

values

abstract val values: Collection<List<Graph.Edge<T>>>

Functions

asString

open fun asString(): String

contains

open fun contains(value: T): Boolean

open fun contains(value: T, predicate: (T) -> Boolean): Boolean

containsCircularVertexes

open fun containsCircularVertexes(value: T): Boolean

containsKey

abstract fun containsKey(key: Graph.Vertex<T>): Boolean

containsValue

abstract fun containsValue(value: List<Graph.Edge<T>>): Boolean

doesNotContainsCircularVertexes

open fun doesNotContainsCircularVertexes(value: T): Boolean

get

abstract operator fun get(key: Graph.Vertex<T>): List<Graph.Edge<T>>?

isEmpty

abstract fun isEmpty(): Boolean

renderer

open fun renderer(block: Any?.() -> String)

toGraphSortedByEdges

open fun toGraphSortedByEdges(): Graph<T>

vertexesFor

open fun vertexesFor(vararg values: T): List<T>

open fun vertexesFor(value: T, predicate: (T) -> Boolean = { it == value }): List<T>