sf.util.graph

Class DirectedGraph<T extends java.lang.Comparable<? super T>>

java.lang.Object

sf.util.graph.DirectedGraph<T>

public class DirectedGraph<T extends java.lang.Comparable<? super T>>
extends java.lang.Object

Constructor Summary

Constructors

Constructor and Description
DirectedGraph(java.lang.String name)

Method Summary

Modifier and Type	Method and Description
void	addEdge(T from, T to) Adds vertices, and a directed edge between them.
Vertex<T>	addVertex(T value) Adds a vertex.
java.util.Set<DirectedEdge<T>>	edgeSet()
java.lang.String	getName()
java.util.Set<DirectedEdge<T>>	getOutgoingEdges(Vertex<T> vertexFrom)
java.lang.String	toString()
java.util.Set<Vertex<T>>	vertexSet()

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

DirectedGraph

public DirectedGraph(java.lang.String name)

Method Detail

addEdge

public void addEdge(T from,
                    T to)

Adds vertices, and a directed edge between them. Simple directed graphs do not allow self-loops. https://en.wikipedia.org/wiki/Loop_(graph_theory)

Parameters:

from - Vertex value at the start of the edge

to - Vertex value at the end of the edge

addVertex

public Vertex<T> addVertex(T value)

Adds a vertex.

Parameters:

value - Vertex value

Returns:

The newly added vertex

edgeSet

public java.util.Set<DirectedEdge<T>> edgeSet()

getName

public java.lang.String getName()

Returns:

the name

getOutgoingEdges

public java.util.Set<DirectedEdge<T>> getOutgoingEdges(Vertex<T> vertexFrom)

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

vertexSet

public java.util.Set<Vertex<T>> vertexSet()