util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator Member List

This is the complete list of members for util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator, including all inherited members.

AddArc(NodeIndexType tail, NodeIndexType head)	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
AddNode(NodeIndexType node)	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
AllForwardArcs() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >
AllForwardArcs() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >
AllNodes() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >
AllNodes() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >
arc_capacity() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >
arc_capacity() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >
ArcIndex typedef	util::BaseGraph< NodeIndexType, ArcIndexType, true >
BaseGraph()	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
BaseGraph(const BaseGraph &)=default	util::BaseGraph< NodeIndexType, ArcIndexType, true >
BaseGraph()	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
BaseGraph(const BaseGraph &)=default	util::BaseGraph< NodeIndexType, ArcIndexType, true >
Build()	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
Build(std::vector< ArcIndexType > *permutation)	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
BuildStartAndForwardHead(SVector< NodeIndexType > *head, std::vector< ArcIndexType > *start, std::vector< ArcIndexType > *permutation)	util::BaseGraph< NodeIndexType, ArcIndexType, true >	protected
BuildStartAndForwardHead(SVector< NodeIndexType > *head, std::vector< ArcIndexType > *start, std::vector< ArcIndexType > *permutation)	util::BaseGraph< NodeIndexType, ArcIndexType, true >	protected
ComputeCumulativeSum(std::vector< ArcIndexType > *v)	util::BaseGraph< NodeIndexType, ArcIndexType, true >	protected
ComputeCumulativeSum(std::vector< ArcIndexType > *v)	util::BaseGraph< NodeIndexType, ArcIndexType, true >	protected
DEFINE_STL_ITERATOR_FUNCTIONS(OppositeIncomingArcIterator)	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
FreezeCapacities()	util::BaseGraph< NodeIndexType, ArcIndexType, true >
FreezeCapacities()	util::BaseGraph< NodeIndexType, ArcIndexType, true >
Head(ArcIndexType arc) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
IncomingArcs(NodeIndexType node) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
IncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
InDegree(NodeIndexType node) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
Index() const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
index_	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	protected
IsArcValid(ArcIndexType arc) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
IsArcValid(ArcIndexType arc) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
IsNodeValid(NodeIndexType node) const	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
IsNodeValid(NodeIndexType node) const	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
kHasNegativeReverseArcs	util::BaseGraph< NodeIndexType, ArcIndexType, true >	static
kHasNegativeReverseArcs	util::BaseGraph< NodeIndexType, ArcIndexType, true >	static
kNilArc	util::BaseGraph< NodeIndexType, ArcIndexType, true >	static
kNilArc	util::BaseGraph< NodeIndexType, ArcIndexType, true >	static
kNilNode	util::BaseGraph< NodeIndexType, ArcIndexType, true >	static
kNilNode	util::BaseGraph< NodeIndexType, ArcIndexType, true >	static
limit_	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	protected
Next()	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
node_capacity() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >
node_capacity() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >
NodeIndex typedef	util::BaseGraph< NodeIndexType, ArcIndexType, true >
num_arcs() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
num_arcs() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
num_nodes() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
num_nodes() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
Ok() const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
operator=(const BaseGraph &)=default	util::BaseGraph< NodeIndexType, ArcIndexType, true >
operator=(const BaseGraph &)=default	util::BaseGraph< NodeIndexType, ArcIndexType, true >
operator[](NodeIndexType node) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
OppositeArc(ArcIndexType arc) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
OppositeIncomingArcIterator(const ReverseArcStaticGraph &graph, NodeIndexType node)	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
OppositeIncomingArcIterator(const ReverseArcStaticGraph &graph, NodeIndexType node, ArcIndexType arc)	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
OppositeIncomingArcs(NodeIndexType node) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
OppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
OutDegree(NodeIndexType node) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
OutgoingArcs(NodeIndexType node) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
OutgoingOrOppositeIncomingArcs(NodeIndexType node) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
OutgoingOrOppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
Reserve(NodeIndexType node_capacity, ArcIndexType arc_capacity)	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
Reserve(NodeIndexType node_capacity, ArcIndexType arc_capacity)	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
ReserveArcs(ArcIndexType bound) override	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	virtual
ReserveNodes(NodeIndexType bound)	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inlinevirtual
ReserveNodes(NodeIndexType bound)	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inlinevirtual
ReverseArcStaticGraph()	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
ReverseArcStaticGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator	inline
size() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
size() const	util::BaseGraph< NodeIndexType, ArcIndexType, true >	inline
Tail(ArcIndexType arc) const	util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
~BaseGraph()=default	util::BaseGraph< NodeIndexType, ArcIndexType, true >	virtual
~BaseGraph()=default	util::BaseGraph< NodeIndexType, ArcIndexType, true >	virtual