Gecode::Graph::ArcImpliesNodes< View > | Propagator for the inherent graph constraint |

Gecode::Graph::ArcNodeCstr | Propagator for ArcNode(a,n1,n2): |

Gecode::Graph::BinaryGraphPropagator< GDV1, p1, GDV2, p2 > | Base class for binary propagators |

Gecode::Graph::BoundsGraphs< GView > | Base class for Graph data-structure to represent the bounds of the graph domain for branchings and propagators |

Gecode::Graph::ComplementPropag< GDV1, GDV2 > | Propagator for the complement graph binary constraint |

Gecode::Graph::ComplVisit | Visitor used by the complement propagator with scanTwoGraphsCompleteNodeArcs |

CPGraphBasic | Most basic example possible for OutAdjSetsGraphView |

CPGraphBasic2vars | Most basic example possible for NodeArcSetsGraphView |

CPGraphComplement | Example to test the Complement constraint with OutAdjSetsGraphView |

CPGraphComplement2vars | Example to test the Complement constraint with NodeArcSetsGraphView |

CPGraphInstUB | Example to test the intantiateUB method of OutAdjSetsGraphView |

CPGraphInstUB2vars | Example to test the intantiateUB method of NodeArcSetsGraphView |

CPGraphSimplePath | Example to test the simple Path propagator with OutAdjSetsGraphView |

CPGraphSimplePath2vars | Example to test the simple Path propagator with NodeArcSetsGraphView |

CPGraphSimplePathHeur | Example to test the branchings with OutAdjSetsGraphView |

CPGraphSimplePathHeur2vars | Example to test the branchings with NodeArcSetsGraphView |

Gecode::Graph::Edge | An Edge of a boost Gecode::Graph::Graph |

Gecode::Set::GlbRanges< Gecode::Graph::NodeSetView< Gecode::Graph::NodeArcSetsGraphView > > | Range iterator over the lower bound of a NodeSetView for NodeArcSetsGraphView |

Gecode::Set::GlbRanges< Gecode::Graph::NodeSetView< Gecode::Graph::OutAdjSetsGraphView > > | Range iterator over the lower bound of a NodeSetView for OutAdjSetsGraphView |

Gecode::Graph::GraphBDMultiple | Multiple-type Graph Branching descriptions |

Gecode::Graph::GraphBDSingle< Type > | Single-type Graph Branching descriptions |

Gecode::Set::LubRanges< Gecode::Graph::NodeSetView< Gecode::Graph::NodeArcSetsGraphView > > | Range iterator over the upper bound of a NodeSetView for NodeArcSetsGraphView |

Gecode::Set::LubRanges< Gecode::Graph::NodeSetView< Gecode::Graph::OutAdjSetsGraphView > > | Range iterator over the upper bound of a NodeSetView for OutAdjSetsGraphView |

Gecode::Graph::Node | A Node of a boost Gecode::Graph::Graph |

Gecode::Graph::NodeArcSetsGraphView | A graph view made over 2 sets: one for the nodes and one for the arcs |

Gecode::Graph::NodeArcSetsGraphView::_int_pair_gecode_iterator_2vars< It > | Arc iterator for the NodeArcSetsGraphView |

Gecode::Graph::NodeSetView< GraphView > | SetView for the nodes of a GraphView |

Gecode::Graph::OutAdjSetsGraphView | A graph view made over sets modeling an adjacency matrix |

Gecode::Graph::OutAdjSetsGraphView::_int_pair_gecode_iterator_outn< It > | Arc iterator for the OutAdjSetsGraphView |

Gecode::Graph::PairToArcIdGecodeIterator< I > | Converts a Gecode value iterator with pair<int,int> to a Gecode Value Iterator with arc ids given an ArcNode |

Gecode::Graph::PathBoundsGraphs< GDV > | BoundsGraphs datastructure for the path propagator |

Gecode::Graph::PathCostPropag< GView > | Propagator for the cost-based filtering for a simple-path |

Gecode::Graph::PathDegreePropag< GView > | Propagator for a node degree=1 constraint |

PathHeurBoundsG< GView > | GraphBounds class used for branching on a constrained path problem |

Gecode::Graph::PathPropag< GView > | Propagator for the simple path constraint |

Gecode::Graph::StlToGecodeRangeIterator< iterator > | Converts a Stl value iterator to a Gecode Range Iterator |

Gecode::Graph::StlToGecodeValIterator< iterator > | Converts a Stl value iterator to a Gecode Value Iterator |

Gecode::Graph::UnaryGraphBranching< GView, BoundsG, GraphBD > | Graph Branching which selects a node or an arc to branch on, includes or excludes it |