Uses of Class org.jruby.dirgra.Edge

Uses of Edge in org.jruby.dirgra

Fields in org.jruby.dirgra declared as Edge
Modifier and Type	Field	Description
`private Edge<T>[]`	DataIterable.`edges`
`private Edge<T>[]`	DataIterator.`edges`
`private Edge<T>[]`	DirectedGraph.`edges`
`private Edge<T>[]`	EdgeTypeIterable.`edges`
`private Edge<T>[]`	EdgeTypeIterator.`edges`
`private static Edge[]`	Vertex.`EMPTY_EDGE_LIST`
`private Edge<T>[]`	Vertex.`incoming`
`private Edge`	DataIterator.`nextEdge`
`private Edge`	EdgeTypeIterator.`nextEdge`
`private Edge<T>[]`	Vertex.`outgoing`

Methods in org.jruby.dirgra that return Edge
Modifier and Type	Method	Description
`protected Edge<T>`	DirectedGraph.`addEdge(Edge<T> newEdge)`
`protected Edge<T>[]`	DirectedGraph.`getEdges()`
`private Edge<T>`	Vertex.`getFirstEdge(java.util.Iterator<Edge<T>> iterator)`
`Edge<T>`	Vertex.`getIncomingEdge()`
`Edge<T>`	Vertex.`getIncomingEdgeOfType(java.lang.Object type)`
`Edge<T>`	Vertex.`getOutgoingEdge()`
`Edge<T>`	Vertex.`getOutgoingEdgeOfType(java.lang.Object type)`
`protected Edge<T>[]`	DirectedGraph.`growEdges(Edge<T>[] array, int realLength)`
`Edge<T>`	EdgeTypeIterator.`next()`

Methods in org.jruby.dirgra that return types with arguments of type Edge
Modifier and Type	Method	Description
`java.util.Collection<Edge<T>>`	DirectedGraph.`edges()`
`java.lang.Iterable<Edge<T>>`	DirectedGraph.`edgesOfType(java.lang.Object type)`
`java.util.Collection<Edge<T>>`	Vertex.`getIncomingEdges()`
`java.lang.Iterable<Edge<T>>`	Vertex.`getIncomingEdgesNotOfType(java.lang.Object type)`
`java.lang.Iterable<Edge<T>>`	Vertex.`getIncomingEdgesOfType(java.lang.Object type)`
`java.util.Collection<Edge<T>>`	Vertex.`getOutgoingEdges()`
`java.lang.Iterable<Edge<T>>`	Vertex.`getOutgoingEdgesNotOfType(java.lang.Object type)`
`java.lang.Iterable<Edge<T>>`	Vertex.`getOutgoingEdgesOfType(java.lang.Object type)`
`java.util.Iterator<Edge<T>>`	EdgeTypeIterable.`iterator()`

Methods in org.jruby.dirgra with parameters of type Edge
Modifier and Type	Method	Description
`protected Edge<T>`	DirectedGraph.`addEdge(Edge<T> newEdge)`
`protected void`	Vertex.`addIncomingEdge(Edge<T> newEdge)`
`protected void`	Vertex.`addOutgoingEdge(Edge<T> newEdge)`
`int`	Vertex.DestinationCompare.`compare(Edge<T> o1, Edge<T> o2)`
`int`	Vertex.SourceCompare.`compare(Edge<T> o1, Edge<T> o2)`
`protected Edge<T>[]`	DirectedGraph.`growEdges(Edge<T>[] array, int realLength)`
`void`	DirectedGraph.`removeEdge(Edge<T> edge)`
`protected void`	Vertex.`removeIncomingEdge(Edge<T> edge)`
`protected void`	Vertex.`removeOutgoingEdge(Edge<T> edge)`

Method parameters in org.jruby.dirgra with type arguments of type Edge
Modifier and Type	Method	Description
`private Edge<T>`	Vertex.`getFirstEdge(java.util.Iterator<Edge<T>> iterator)`

Constructors in org.jruby.dirgra with parameters of type Edge
Constructor	Description
`DataIterable(Edge<T>[] edges, int edgesLength, java.lang.Object type, boolean source, boolean negate)`
`DataIterator(Edge<T>[] edges, int edgesLength, java.lang.Object type, boolean source, boolean negate)`
`EdgeTypeIterable(Edge<T>[] edges, int edgesLength, java.lang.Object type)`
`EdgeTypeIterable(Edge<T>[] edges, int edgesLength, java.lang.Object type, boolean negate)`
`EdgeTypeIterator(Edge<T>[] edges, int edgesLength, java.lang.Object type, boolean negate)`