AddArc(NodeIndexType tail, NodeIndexType head) | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
AddNode(NodeIndexType node) | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
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::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | inline |
Build(std::vector< ArcIndexType > *permutation) | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
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(OutgoingArcIterator) | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
FreezeCapacities() | util::BaseGraph< NodeIndexType, ArcIndexType, true > | |
FreezeCapacities() | util::BaseGraph< NodeIndexType, ArcIndexType, true > | |
Head(ArcIndexType arc) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
IncomingArcs(NodeIndexType node) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
IncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
InDegree(NodeIndexType node) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
Index() const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | inline |
IsArcValid(ArcIndexType arc) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
IsArcValid(ArcIndexType arc) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | 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 |
Next() | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | 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::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | inline |
operator=(const OutgoingArcIterator &)=default | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
util::BaseGraph< NodeIndexType, ArcIndexType, true >::operator=(const BaseGraph &)=default | util::BaseGraph< NodeIndexType, ArcIndexType, true > | |
operator[](NodeIndexType node) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OppositeArc(ArcIndexType arc) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OppositeIncomingArcs(NodeIndexType node) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OutDegree(NodeIndexType node) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OutgoingArcIterator(const OutgoingArcIterator &)=default | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OutgoingArcIterator(const ReverseArcMixedGraph &graph, NodeIndexType node) | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | inline |
OutgoingArcIterator(const ReverseArcMixedGraph &graph, NodeIndexType node, ArcIndexType arc) | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | inline |
OutgoingArcs(NodeIndexType node) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OutgoingOrOppositeIncomingArcs(NodeIndexType node) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
OutgoingOrOppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
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::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | virtual |
ReserveNodes(NodeIndexType bound) | util::BaseGraph< NodeIndexType, ArcIndexType, true > | inlinevirtual |
ReserveNodes(NodeIndexType bound) | util::BaseGraph< NodeIndexType, ArcIndexType, true > | inlinevirtual |
ReverseArcMixedGraph() | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | inline |
ReverseArcMixedGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity) | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | inline |
size() const | util::BaseGraph< NodeIndexType, ArcIndexType, true > | inline |
size() const | util::BaseGraph< NodeIndexType, ArcIndexType, true > | inline |
Tail(ArcIndexType arc) const | util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
~BaseGraph()=default | util::BaseGraph< NodeIndexType, ArcIndexType, true > | virtual |
~BaseGraph()=default | util::BaseGraph< NodeIndexType, ArcIndexType, true > | virtual |