lemon/lemon/dijkstra.h

68     typedef GR Digraph;  typedef
88     typedef typename Digraph::template NodeMap<int> HeapCrossRef;
94     static HeapCrossRef *createHeapCrossRef(const Digraph &g)  in createHeapCrossRef()
120     typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
126     static PredMap *createPredMap(const Digraph &g)  in createPredMap()
136     typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
143     static ProcessedMap *createProcessedMap(const Digraph &g)  in createProcessedMap()
145     static ProcessedMap *createProcessedMap(const Digraph &)  in createProcessedMap()
155     typedef typename Digraph::template NodeMap<typename LEN::Value> DistMap;
161     static DistMap *createDistMap(const Digraph &g)  in createDistMap()
211     typedef typename TR::Digraph Digraph;  typedef
225     typedef PredMapPath<Digraph, PredMap> Path;
239     typedef typename Digraph::Node Node;
240     typedef typename Digraph::NodeIt NodeIt;
241     typedef typename Digraph::Arc Arc;
242     typedef typename Digraph::OutArcIt OutArcIt;
245     const Digraph *G;
305       static PredMap *createPredMap(const Digraph &)  in createPredMap()
319       : public Dijkstra< Digraph, LengthMap, SetPredMapTraits<T> > {
320       typedef Dijkstra< Digraph, LengthMap, SetPredMapTraits<T> > Create;
326       static DistMap *createDistMap(const Digraph &)  in createDistMap()
340       : public Dijkstra< Digraph, LengthMap, SetDistMapTraits<T> > {
341       typedef Dijkstra< Digraph, LengthMap, SetDistMapTraits<T> > Create;
347       static ProcessedMap *createProcessedMap(const Digraph &)  in createProcessedMap()
361       : public Dijkstra< Digraph, LengthMap, SetProcessedMapTraits<T> > {
362       typedef Dijkstra< Digraph, LengthMap, SetProcessedMapTraits<T> > Create;
366       typedef typename Digraph::template NodeMap<bool> ProcessedMap;
367       static ProcessedMap *createProcessedMap(const Digraph &g)  in createProcessedMap()
379       : public Dijkstra< Digraph, LengthMap, SetStandardProcessedMapTraits > {
380       typedef Dijkstra< Digraph, LengthMap, SetStandardProcessedMapTraits >
388       static HeapCrossRef *createHeapCrossRef(const Digraph &) {  in createHeapCrossRef()
407     template <class H, class CR = typename Digraph::template NodeMap<int> >
409       : public Dijkstra< Digraph, LengthMap, SetHeapTraits<H, CR> > {
410       typedef Dijkstra< Digraph, LengthMap, SetHeapTraits<H, CR> > Create;
417       static HeapCrossRef *createHeapCrossRef(const Digraph &G) {  in createHeapCrossRef()
438     template <class H, class CR = typename Digraph::template NodeMap<int> >
440       : public Dijkstra< Digraph, LengthMap, SetStandardHeapTraits<H, CR> > {
441       typedef Dijkstra< Digraph, LengthMap, SetStandardHeapTraits<H, CR> >
458       : public Dijkstra<Digraph, LengthMap, SetOperationTraitsTraits<T> > {
459       typedef Dijkstra<Digraph, LengthMap, SetOperationTraitsTraits<T> >
476     Dijkstra(const Digraph& g, const LengthMap& length) :  in Dijkstra()
935     typedef GR Digraph;  typedef
954     typedef typename Digraph::template NodeMap<int> HeapCrossRef;
960     static HeapCrossRef *createHeapCrossRef(const Digraph &g)  in createHeapCrossRef()
971     typedef BinHeap<Value, typename Digraph::template NodeMap<int>,
989     typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;
995     static PredMap *createPredMap(const Digraph &g)  in createPredMap()
1005     typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
1012     static ProcessedMap *createProcessedMap(const Digraph &g)  in createProcessedMap()
1014     static ProcessedMap *createProcessedMap(const Digraph &)  in createProcessedMap()
1024     typedef typename Digraph::template NodeMap<typename LEN::Value> DistMap;
1030     static DistMap *createDistMap(const Digraph &g)  in createDistMap()
1039     typedef lemon::Path<Digraph> Path;
1053     typedef typename Base::Digraph::Node Node;
1108     typedef typename TR::Digraph Digraph;  typedef
1110     typedef typename Digraph::Node Node;
1111     typedef typename Digraph::NodeIt NodeIt;
1112     typedef typename Digraph::Arc Arc;
1113     typedef typename Digraph::OutArcIt OutArcIt;
1134     DijkstraWizard(const Digraph &g, const LengthMap &l) :  in DijkstraWizard()
1148       Dijkstra<Digraph,LengthMap,TR>  in run()
1149         dijk(*reinterpret_cast<const Digraph*>(Base::_g),  in run()
1169       Dijkstra<Digraph,LengthMap,TR>  in run()
1170         dijk(*reinterpret_cast<const Digraph*>(Base::_g),  in run()
1189       static PredMap *createPredMap(const Digraph &) { return 0; };  in createPredMap()
1208       static DistMap *createDistMap(const Digraph &) { return 0; };  in createDistMap()
1228       static ProcessedMap *createProcessedMap(const Digraph &) { return 0; };  in createProcessedMap()