Package de.scravy.bedrock
Class SimpleDirectedGraph
java.lang.Object
de.scravy.bedrock.SimpleDirectedGraph
- Direct Known Subclasses:
DirectedGraph
public class SimpleDirectedGraph extends Object
A simple directed graph is defined by it's vertices and edges, where the vertices
are simple indices starting from zero up to the number of vertices.
-
Method Summary
Modifier and Type Method Description intcountIncoming(int index)intcountOutgoing(int index)voidforEachIncoming(int index, IntConsumer consumer)voidforEachOutgoing(int index, IntConsumer consumer)booleanhasIncoming(int index)booleanhasOutgoing(int index)
-
Method Details
-
forEachOutgoing
-
countOutgoing
public final int countOutgoing(int index) -
hasOutgoing
public final boolean hasOutgoing(int index) -
forEachIncoming
-
countIncoming
public final int countIncoming(int index) -
hasIncoming
public final boolean hasIncoming(int index)
-