core/org.jetbrains.kotlinx.dataframe.impl/DirectedAcyclicGraph

DirectedAcyclicGraph

Represents a directed acyclic graph (DAG) of generic type T.

This class is immutable and guarantees that the graph does not contain any cycles. It provides functionality to find the nearest common ancestor of two vertices in the graph (findNearestCommonVertex).

Use the Builder class or buildDag function to create a new instance of this class.

Type Parameters

The type of items in the graph.

Types

Builder

class Builder<T>

Companion

object Companion

Functions

findNearestCommonVertex

fun findNearestCommonVertex(vertex1: T, vertex2: T): T?

map

fun <R> map(conversion: (T) -> R): DirectedAcyclicGraph<R>