Uses of Class com.google.common.graph.ElementOrder (Guava: Google Core Libraries for Java 33.3.0-jre API)

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

Methods in com.google.common.graph that return ElementOrder
Modifier and Type	Method	Description
`ElementOrder<E>`	Network.`edgeOrder()`	Returns the order of iteration for the elements of `Network.edges()`.
`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>`	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>`	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>`	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()`.