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