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
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 ofNetwork.edges()
.ElementOrder<N>
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)
.ElementOrder<N>
ImmutableGraph. incidentEdgeOrder()
ElementOrder<N>
ImmutableValueGraph. incidentEdgeOrder()
ElementOrder<N>
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 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 ofGraph.nodes()
.ElementOrder<N>
Network. nodeOrder()
Returns the order of iteration for the elements ofNetwork.nodes()
.ElementOrder<N>
ValueGraph. nodeOrder()
Returns the order of iteration for the elements ofValueGraph.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 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 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 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()
.
-