nova.internal.core.util

Class TopologicalSort.DirectedGraph<T>

java.lang.Object

nova.internal.core.util.TopologicalSort.DirectedGraph<T>

All Implemented Interfaces:

java.lang.Iterable<T>

Enclosing class:

TopologicalSort

public static class TopologicalSort.DirectedGraph<T>
extends java.lang.Object
implements java.lang.Iterable<T>

Constructor Summary

Constructors

Constructor and Description
DirectedGraph()

Method Summary

Modifier and Type	Method and Description
void	addEdge(T from, T to)
boolean	addNode(T node)
boolean	edgeExists(T from, T to)
java.util.Set<T>	edgesFrom(T from)
boolean	isEmpty()
java.util.Iterator<T>	iterator()
void	removeEdge(T from, T to)
boolean	removeNode(T node)
int	size()
java.util.stream.Stream<T>	stream()
java.lang.String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

DirectedGraph

public DirectedGraph()

Method Detail

addNode

public boolean addNode(T node)

removeNode

public boolean removeNode(T node)

addEdge

public void addEdge(T from,
                    T to)

removeEdge

public void removeEdge(T from,
                       T to)

edgeExists

public boolean edgeExists(T from,
                          T to)

edgesFrom

public java.util.Set<T> edgesFrom(T from)

iterator

public java.util.Iterator<T> iterator()

Specified by:

iterator in interface java.lang.Iterable<T>

stream

public java.util.stream.Stream<T> stream()

size

public int size()

isEmpty

public boolean isEmpty()

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object