Uses of Class
com.google.common.graph.ElementOrder
Packages that use ElementOrder
-
Uses of ElementOrder in com.google.common.graph
Fields in com.google.common.graph declared as ElementOrderModifier and TypeFieldDescription(package private) ElementOrder
<? super E> NetworkBuilder.edgeOrder
private final ElementOrder
<E> StandardNetwork.edgeOrder
(package private) ElementOrder
<N> AbstractGraphBuilder.incidentEdgeOrder
private final ElementOrder
<N> StandardMutableValueGraph.incidentEdgeOrder
(package private) ElementOrder
<N> AbstractGraphBuilder.nodeOrder
private final ElementOrder
<N> StandardNetwork.nodeOrder
private final ElementOrder
<N> StandardValueGraph.nodeOrder
Methods in com.google.common.graph that return ElementOrderModifier and TypeMethodDescription(package private) <T1 extends T>
ElementOrder<T1> ElementOrder.cast()
ForwardingNetwork.edgeOrder()
Network.edgeOrder()
Returns the order of iteration for the elements ofNetwork.edges()
.StandardNetwork.edgeOrder()
AbstractBaseGraph.incidentEdgeOrder()
BaseGraph.incidentEdgeOrder()
Returns anElementOrder
that specifies the order of iteration for the elements ofBaseGraph.edges()
,BaseGraph.adjacentNodes(Object)
,BaseGraph.predecessors(Object)
,BaseGraph.successors(Object)
andBaseGraph.incidentEdges(Object)
.ForwardingGraph.incidentEdgeOrder()
ForwardingValueGraph.incidentEdgeOrder()
Graph.incidentEdgeOrder()
Returns anElementOrder
that specifies the order of iteration for the elements ofGraph.edges()
,Graph.adjacentNodes(Object)
,Graph.predecessors(Object)
,Graph.successors(Object)
andGraph.incidentEdges(Object)
.ImmutableGraph.incidentEdgeOrder()
ImmutableValueGraph.incidentEdgeOrder()
StandardMutableValueGraph.incidentEdgeOrder()
ValueGraph.incidentEdgeOrder()
Returns anElementOrder
that specifies the order of iteration for the elements ofValueGraph.edges()
,ValueGraph.adjacentNodes(Object)
,ValueGraph.predecessors(Object)
,ValueGraph.successors(Object)
andValueGraph.incidentEdges(Object)
.static <S> ElementOrder
<S> ElementOrder.insertion()
Returns an instance which specifies that insertion ordering is guaranteed.static <S extends Comparable<? super S>>
ElementOrder<S> ElementOrder.natural()
Returns an instance which specifies that the natural ordering of the elements is guaranteed.BaseGraph.nodeOrder()
Returns the order of iteration for the elements ofBaseGraph.nodes()
.ForwardingGraph.nodeOrder()
ForwardingNetwork.nodeOrder()
ForwardingValueGraph.nodeOrder()
Graph.nodeOrder()
Returns the order of iteration for the elements ofGraph.nodes()
.Network.nodeOrder()
Returns the order of iteration for the elements ofNetwork.nodes()
.StandardNetwork.nodeOrder()
StandardValueGraph.nodeOrder()
ValueGraph.nodeOrder()
Returns the order of iteration for the elements ofValueGraph.nodes()
.static <S> ElementOrder
<S> ElementOrder.sorted
(Comparator<S> comparator) Returns an instance which specifies that the ordering of the elements is guaranteed to be determined bycomparator
.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 ElementOrderModifier and TypeMethodDescription<E1 extends E>
NetworkBuilder<N, E1> NetworkBuilder.edgeOrder
(ElementOrder<E1> edgeOrder) Specifies the order of iteration for the elements ofNetwork.edges()
.<N1 extends N>
GraphBuilder<N1> GraphBuilder.incidentEdgeOrder
(ElementOrder<N1> incidentEdgeOrder) Specifies the order of iteration for the elements ofGraph.edges()
,Graph.adjacentNodes(Object)
,Graph.predecessors(Object)
,Graph.successors(Object)
andGraph.incidentEdges(Object)
.<N1 extends N>
ValueGraphBuilder<N1, V> ValueGraphBuilder.incidentEdgeOrder
(ElementOrder<N1> incidentEdgeOrder) Specifies the order of iteration for the elements ofValueGraph.edges()
,ValueGraph.adjacentNodes(Object)
,ValueGraph.predecessors(Object)
,ValueGraph.successors(Object)
andValueGraph.incidentEdges(Object)
.<N1 extends N>
GraphBuilder<N1> GraphBuilder.nodeOrder
(ElementOrder<N1> nodeOrder) Specifies the order of iteration for the elements ofGraph.nodes()
.<N1 extends N>
NetworkBuilder<N1, E> NetworkBuilder.nodeOrder
(ElementOrder<N1> nodeOrder) Specifies the order of iteration for the elements ofNetwork.nodes()
.<N1 extends N>
ValueGraphBuilder<N1, V> ValueGraphBuilder.nodeOrder
(ElementOrder<N1> nodeOrder) Specifies the order of iteration for the elements ofGraph.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)