DirectedAcyclicGraph

A class which represents a simple directed acyclic graph.

<T>

Class for the data objects of this graph.

Constructors

constructor()

open fun addEdge(@NonNull node: @NonNull T, @NonNull incomingEdge: @NonNull T)

Add an edge to the graph.

open fun addNode(@NonNull node: @NonNull T)

Add a node to the graph.

open fun clear()

Clears the internal graph, and releases resources to pools.

open fun contains(@NonNull node: @NonNull T): Boolean

Returns true if the node is already present in the graph, false otherwise.

@Nullable

open fun getIncomingEdges(@NonNull node: @NonNull T): @Nullable List<T>

Get any incoming edges from the given node.

@Nullable

open fun getOutgoingEdges(@NonNull node: @NonNull T): @Nullable List<T>

Get any outgoing edges for the given node (i.e.

@NonNull

open fun getSortedList(): @NonNull ArrayList<T>

Returns a topologically sorted list of the nodes in this graph.

open fun hasOutgoingEdges(@NonNull node: @NonNull T): Boolean

Checks whether we have any outgoing edges for the given node (i.e.