Uses of Class
com.google.common.graph.ElementOrder

Packages that use ElementOrder

Package	Description
com.google.common.graph	An API for representing graph (node and edge) data.

Uses of ElementOrder in com.google.common.graph

Fields in com.google.common.graph declared as ElementOrder

Modifier and Type	Field	Description
(package private) ElementOrder<? super E>	NetworkBuilder.edgeOrder
private ElementOrder<E>	StandardNetwork.edgeOrder
(package private) ElementOrder<N>	AbstractGraphBuilder.incidentEdgeOrder
private ElementOrder<N>	StandardMutableValueGraph.incidentEdgeOrder
(package private) ElementOrder<N>	AbstractGraphBuilder.nodeOrder
private ElementOrder<N>	StandardNetwork.nodeOrder
private ElementOrder<N>	StandardValueGraph.nodeOrder

Methods in com.google.common.graph that return ElementOrder

Modifier and Type	Method	Description
(package private) <T1 extends T> ElementOrder<T1>	ElementOrder.cast()
ElementOrder<E>	ForwardingNetwork.edgeOrder()
ElementOrder<E>	Network.edgeOrder()	Returns the order of iteration for the elements of Network.edges().
ElementOrder<E>	StandardNetwork.edgeOrder()
ElementOrder<N>	AbstractBaseGraph.incidentEdgeOrder()
ElementOrder<N>	BaseGraph.incidentEdgeOrder()	Returns an ElementOrder that specifies the order of iteration for the elements of BaseGraph.edges(), BaseGraph.adjacentNodes(Object), BaseGraph.predecessors(Object), BaseGraph.successors(Object) and BaseGraph.incidentEdges(Object).
ElementOrder<N>	ForwardingGraph.incidentEdgeOrder()
ElementOrder<N>	ForwardingValueGraph.incidentEdgeOrder()
ElementOrder<N>	Graph.incidentEdgeOrder()	Returns an ElementOrder that specifies the order of iteration for the elements of Graph.edges(), Graph.adjacentNodes(Object), Graph.predecessors(Object), Graph.successors(Object) and Graph.incidentEdges(Object).
ElementOrder<N>	ImmutableGraph.incidentEdgeOrder()
ElementOrder<N>	ImmutableValueGraph.incidentEdgeOrder()
ElementOrder<N>	StandardMutableValueGraph.incidentEdgeOrder()
ElementOrder<N>	ValueGraph.incidentEdgeOrder()	Returns an ElementOrder that specifies the order of iteration for the elements of ValueGraph.edges(), ValueGraph.adjacentNodes(Object), ValueGraph.predecessors(Object), ValueGraph.successors(Object) and ValueGraph.incidentEdges(Object).
static <S> ElementOrder<S>	ElementOrder.insertion()	Returns an instance which specifies that insertion ordering is guaranteed.
static <S extends java.lang.Comparable<? super S>> ElementOrder<S>	ElementOrder.natural()	Returns an instance which specifies that the natural ordering of the elements is guaranteed.
ElementOrder<N>	BaseGraph.nodeOrder()	Returns the order of iteration for the elements of BaseGraph.nodes().
ElementOrder<N>	ForwardingGraph.nodeOrder()
ElementOrder<N>	ForwardingNetwork.nodeOrder()
ElementOrder<N>	ForwardingValueGraph.nodeOrder()
ElementOrder<N>	Graph.nodeOrder()	Returns the order of iteration for the elements of Graph.nodes().
ElementOrder<N>	Network.nodeOrder()	Returns the order of iteration for the elements of Network.nodes().
ElementOrder<N>	StandardNetwork.nodeOrder()
ElementOrder<N>	StandardValueGraph.nodeOrder()
ElementOrder<N>	ValueGraph.nodeOrder()	Returns the order of iteration for the elements of ValueGraph.nodes().
static <S> ElementOrder<S>	ElementOrder.sorted(java.util.Comparator<S> comparator)	Returns an instance which specifies that the ordering of the elements is guaranteed to be determined by comparator.
static <S> ElementOrder<S>	ElementOrder.stable()	Returns an instance which specifies that ordering is guaranteed to be always be the same across iterations, and across releases.
static <S> ElementOrder<S>	ElementOrder.unordered()	Returns an instance which specifies that no ordering is guaranteed.

Methods in com.google.common.graph with parameters of type ElementOrder

Modifier and Type	Method	Description
<E1 extends E> NetworkBuilder<N,E1>	NetworkBuilder.edgeOrder(ElementOrder<E1> edgeOrder)	Specifies the order of iteration for the elements of Network.edges().
<N1 extends N> GraphBuilder<N1>	GraphBuilder.incidentEdgeOrder(ElementOrder<N1> incidentEdgeOrder)	Specifies the order of iteration for the elements of Graph.edges(), Graph.adjacentNodes(Object), Graph.predecessors(Object), Graph.successors(Object) and Graph.incidentEdges(Object).
<N1 extends N> ValueGraphBuilder<N1,V>	ValueGraphBuilder.incidentEdgeOrder(ElementOrder<N1> incidentEdgeOrder)	Specifies the order of iteration for the elements of ValueGraph.edges(), ValueGraph.adjacentNodes(Object), ValueGraph.predecessors(Object), ValueGraph.successors(Object) and ValueGraph.incidentEdges(Object).
<N1 extends N> GraphBuilder<N1>	GraphBuilder.nodeOrder(ElementOrder<N1> nodeOrder)	Specifies the order of iteration for the elements of Graph.nodes().
<N1 extends N> NetworkBuilder<N1,E>	NetworkBuilder.nodeOrder(ElementOrder<N1> nodeOrder)	Specifies the order of iteration for the elements of Network.nodes().
<N1 extends N> ValueGraphBuilder<N1,V>	ValueGraphBuilder.nodeOrder(ElementOrder<N1> nodeOrder)	Specifies the order of iteration for the elements of Graph.nodes().
(package private) static <N,V> DirectedGraphConnections<N,V>	DirectedGraphConnections.of(ElementOrder<N> incidentEdgeOrder)
(package private) static <N,V> UndirectedGraphConnections<N,V>	UndirectedGraphConnections.of(ElementOrder<N> incidentEdgeOrder)