util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator Member List

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

AddArc(NodeIndexType tail, NodeIndexType head)	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
AddNode(NodeIndexType node)	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
AllForwardArcs() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >
AllForwardArcs() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >
AllNodes() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >
AllNodes() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >
arc_capacity() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >
arc_capacity() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >
ArcIndex typedef	util::BaseGraph< NodeIndexType, ArcIndexType, false >
ArcIndex typedef	util::BaseGraph< NodeIndexType, ArcIndexType, false >
BaseGraph()	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
BaseGraph(const BaseGraph &)=default	util::BaseGraph< NodeIndexType, ArcIndexType, false >
BaseGraph()	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
BaseGraph(const BaseGraph &)=default	util::BaseGraph< NodeIndexType, ArcIndexType, false >
Build()	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
Build(std::vector< ArcIndexType > *permutation)	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
BuildStartAndForwardHead(SVector< NodeIndexType > *head, std::vector< ArcIndexType > *start, std::vector< ArcIndexType > *permutation)	util::BaseGraph< NodeIndexType, ArcIndexType, false >	protected
BuildStartAndForwardHead(SVector< NodeIndexType > *head, std::vector< ArcIndexType > *start, std::vector< ArcIndexType > *permutation)	util::BaseGraph< NodeIndexType, ArcIndexType, false >	protected
ComputeCumulativeSum(std::vector< ArcIndexType > *v)	util::BaseGraph< NodeIndexType, ArcIndexType, false >	protected
ComputeCumulativeSum(std::vector< ArcIndexType > *v)	util::BaseGraph< NodeIndexType, ArcIndexType, false >	protected
difference_type typedef	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
FreezeCapacities()	util::BaseGraph< NodeIndexType, ArcIndexType, false >
FreezeCapacities()	util::BaseGraph< NodeIndexType, ArcIndexType, false >
Head(ArcIndexType arc) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
Index() const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
IsArcValid(ArcIndexType arc) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
IsArcValid(ArcIndexType arc) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
IsNodeValid(NodeIndexType node) const	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
IsNodeValid(NodeIndexType node) const	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
iterator_category typedef	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
kHasNegativeReverseArcs	util::BaseGraph< NodeIndexType, ArcIndexType, false >	static
kHasNegativeReverseArcs	util::BaseGraph< NodeIndexType, ArcIndexType, false >	static
kNilArc	util::BaseGraph< NodeIndexType, ArcIndexType, false >	static
kNilArc	util::BaseGraph< NodeIndexType, ArcIndexType, false >	static
kNilNode	util::BaseGraph< NodeIndexType, ArcIndexType, false >	static
kNilNode	util::BaseGraph< NodeIndexType, ArcIndexType, false >	static
ListGraph()	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
ListGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
Next()	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
node_capacity() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >
node_capacity() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >
NodeIndex typedef	util::BaseGraph< NodeIndexType, ArcIndexType, false >
NodeIndex typedef	util::BaseGraph< NodeIndexType, ArcIndexType, false >
num_arcs() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
num_arcs() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
num_nodes() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
num_nodes() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
Ok() const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
operator!=(const typename ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator &other) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
operator*() const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
operator++()	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
operator=(const BaseGraph &)=default	util::BaseGraph< NodeIndexType, ArcIndexType, false >
operator=(const BaseGraph &)=default	util::BaseGraph< NodeIndexType, ArcIndexType, false >
operator[](NodeIndexType node) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
OutDegree(NodeIndexType node) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
OutgoingArcs(NodeIndexType node) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
OutgoingHeadIterator(const ListGraph &graph, NodeIndexType node)	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
OutgoingHeadIterator(const ListGraph &graph, NodeIndexType node, ArcIndexType arc)	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	inline
pointer typedef	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
reference typedef	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
Reserve(NodeIndexType node_capacity, ArcIndexType arc_capacity)	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
Reserve(NodeIndexType node_capacity, ArcIndexType arc_capacity)	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
ReserveArcs(ArcIndexType bound) override	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	virtual
ReserveNodes(NodeIndexType bound) override	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator	virtual
size() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
size() const	util::BaseGraph< NodeIndexType, ArcIndexType, false >	inline
Tail(ArcIndexType arc) const	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
value_type typedef	util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
~BaseGraph()=default	util::BaseGraph< NodeIndexType, ArcIndexType, false >	virtual
~BaseGraph()=default	util::BaseGraph< NodeIndexType, ArcIndexType, false >	virtual