kollections-interoperable/kollections/Graph

Graph

interface Graph<out N, out E> : Collection<N>

Inheritors

Functions

abstract fun <K2, V2> associate(transformer: (N) -> MapEntry<K2, V2>): Map<K2, V2>

abstract operator override fun contains(element: N): Boolean

abstract fun containsAll(elements: Collection<N>): Boolean

abstract fun edge(from: @UnsafeVariance N, to: @UnsafeVariance N): E?

abstract fun filter(predicate: (N) -> Boolean): List<N>

abstract fun first(): N

abstract fun firstOrNull(): N?

abstract fun forEach(lambda: (item: N) -> Unit)

forEachWithIndex

abstract fun forEachWithIndex(lambda: (item: N, index: Int) -> Unit)

abstract fun hasPath(from: @UnsafeVariance N, to: @UnsafeVariance N): Boolean

abstract fun isConnected(node1: @UnsafeVariance N, node2: @UnsafeVariance N): Boolean

abstract override fun isEmpty(): Boolean

abstract operator fun iterator(): Iterator<N>

abstract fun loops(): List<Set<N>>

abstract fun <R> map(transform: (item: N) -> R): List<R>

abstract fun <R> mapToArray(transform: (item: N) -> R): Array<R>

mapToArrayWithIndex

abstract fun <R> mapToArrayWithIndex(transform: (item: N, index: Int) -> R): Array<R>

abstract fun <R> mapWithIndex(transform: (item: N, index: Int) -> R): List<R>

abstract fun paths(from: @UnsafeVariance N, to: @UnsafeVariance N): List<Set<N>>

inline fun <E> Collection<E>.toIList(): List<E>

inline fun <E> Collection<E>.toIMutableList(): MutableList<E>

inline fun <E> Collection<E>.toIMutableSet(): MutableSet<E>

inline fun <E> Collection<E>.toISet(): Set<E>

abstract fun uniqueLoops(): List<Set<N>>

Properties

abstract override val size: Int