1.13.0

quarkdown-core/com.quarkdown.core.graph/PersistentDirectedGraph

PersistentDirectedGraph

data class PersistentDirectedGraph<T>(val vertices: PersistentSet<T> = persistentSetOf(), adjacency: PersistentMap<T, PersistentSet<T>> = persistentMapOf()) : Graph<T>

An immutable directed graph using persistent data structures. Updates return new instances that share structure with the original, providing O(log n) time complexity per operation.

Parameters

T

the type of vertices in the graph

vertices

the set of vertices in the graph

adjacency

a map from each vertex to its set of neighbors (outgoing edges)

Constructors

PersistentDirectedGraph

constructor(vertices: PersistentSet<T> = persistentSetOf(), adjacency: PersistentMap<T, PersistentSet<T>> = persistentMapOf())

Properties

open override val edges: Set<Pair<T, T>>

The set of edges in the graph, represented as pairs of vertices.

open override val vertices: PersistentSet<T>

val <T> Graph<T>.visitableOnce: VisitableOnceGraph<T>

Converts a Graph into a VisitableOnceGraph which allows visiting each vertex only once.

Functions

open fun addEdge(pair: Pair<T, T>): Graph<T>

open override fun addEdge(from: T, to: T): PersistentDirectedGraph<T>

Adds an edge from one vertex to another.

open override fun addVertex(value: T): PersistentDirectedGraph<T>

Adds a vertex to the graph.

addVertexAndEdge

open override fun addVertexAndEdge(vertex: T, edgeFrom: T, edgeTo: T): PersistentDirectedGraph<T>

Adds a vertex and an edge in a single operation.

findResourceByPath

fun Graph<Subdocument>.findResourceByPath(path: String): Subdocument.Resource?

Finds a Subdocument.Resource vertex in the graph by its absolute path.

open override fun getNeighbors(vertex: T): Sequence<T>