org.jruby.ir.util

Class DirectedGraph<T>

java.lang.Object

org.jruby.ir.util.DirectedGraph<T>

public class DirectedGraph<T>
extends Object

Meant to be single-threaded. More work on whole impl if not.

Constructor Summary

Constructors

Constructor and Description
DirectedGraph()

Method Summary

Methods

Modifier and Type	Method and Description
void	addEdge(T source, T destination, Object type)
Collection<T>	allData()
Collection<Edge<T>>	edges()
Iterable<Edge<T>>	edgesOfType(Object type)
Vertex<T>	findVertexFor(T data)
Collection<T>	getInorderData()
void	removeEdge(Edge edge)
void	removeEdge(T source, T destination)
void	removeVertexFor(T data)
int	size()
String	toString()
Vertex<T>	vertexFor(T data)
Collection<Vertex<T>>	vertices()

Methods inherited from class java.lang.Object

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

Constructor Detail

DirectedGraph

public DirectedGraph()

Method Detail

vertices

public Collection<Vertex<T>> vertices()

edges

public Collection<Edge<T>> edges()

edgesOfType

public Iterable<Edge<T>> edgesOfType(Object type)

allData

public Collection<T> allData()

getInorderData

public Collection<T> getInorderData()

Returns:

data in the order it was added to this graph.

addEdge

public void addEdge(T source,
           T destination,
           Object type)

removeEdge

public void removeEdge(Edge edge)

removeEdge

public void removeEdge(T source,
              T destination)

findVertexFor

public Vertex<T> findVertexFor(T data)

vertexFor

public Vertex<T> vertexFor(T data)

Returns:

vertex for given data. If vertex is not present it creates vertex and returns it.

removeVertexFor

public void removeVertexFor(T data)

size

public int size()

Returns:

the number of vertices in the graph.

toString

public String toString()

Overrides:

toString in class Object