Package de.scravy.bedrock

Class DirectedGraph<V>

java.lang.Object

de.scravy.bedrock.SimpleDirectedGraph

de.scravy.bedrock.DirectedGraph<V>

public class DirectedGraph<V>
extends SimpleDirectedGraph

Method Summary

Modifier and Type	Method	Description
int	countIncomingEdges(V vertex)
int	countOutgoingEdges(V vertex)
Seq<Pair<V,V>>	edges()
void	forEachIncomingEdge(V vertex, Consumer<V> consumer)
void	forEachOutgoingEdge(V vertex, Consumer<V> consumer)
static <V> DirectedGraph<V>	fromEdges(Seq<Pair<V,V>> edges)
boolean	hasIncomingEdges(V vertex)
boolean	hasOutgoingEdges(V vertex)
int	index(V vertex)
V	vertex(int index)
Seq<V>	vertices()

Methods inherited from class de.scravy.bedrock.SimpleDirectedGraph

countIncoming, countOutgoing, forEachIncoming, forEachOutgoing, hasIncoming, hasOutgoing

Methods inherited from class java.lang.Object

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

Method Details

vertex

@Nonnull public V vertex(int index)

index

public int index(@Nonnull V vertex)

vertices

public Seq<V> vertices()

forEachOutgoingEdge

public void forEachOutgoingEdge(@Nonnull V vertex, @Nonnull Consumer<V> consumer)

countOutgoingEdges

@Nonnegative public int countOutgoingEdges(@Nonnull V vertex)

hasOutgoingEdges

public boolean hasOutgoingEdges(@Nonnull V vertex)

forEachIncomingEdge

public void forEachIncomingEdge(@Nonnull V vertex, @Nonnull Consumer<V> consumer)

countIncomingEdges

@Nonnegative public int countIncomingEdges(@Nonnull V vertex)

hasIncomingEdges

public boolean hasIncomingEdges(@Nonnull V vertex)

edges

public Seq<Pair<V,V>> edges()

fromEdges

@Nonnull public static <V> DirectedGraph<V> fromEdges(@Nonnull Seq<Pair<V,V>> edges)