- d -

• DagShortestPath() : DagShortestPath< _Graph, _LengthMap, _Traits >
• DagShortestPathWizard() : DagShortestPathWizard< _Traits >
• DagShortestPathWizardBase() : DagShortestPathWizardBase< _Graph, _LengthMap >
• DataFormatError() : DataFormatError
• deactivate() : Elevator< Graph, Item > , LinkedElevator< Graph, Item >
• DebugMap() : DebugMap< _Graph, _Item, _Value >
• decomposition() : MaxMatching< Graph >
• decrease() : BinHeap< _Prio, _ItemIntMap, _Compare > , BucketHeap< _ItemIntMap, minimize > , FibHeap< _Prio, _ItemIntMap, _Compare > , RadixHeap< _ItemIntMap > , HeapUnionFind< _Value, _ItemIntMap, _Comp > , Heap< Prio, ItemIntMap >
• defaultEpsilon() : Tolerance< float > , Tolerance< double > , Tolerance< long double >
• DefaultGraphToEpsTraits() : DefaultGraphToEpsTraits< G >
• deg() : Polynomial< T >
• delay() : ConstrainedShortestPath< Graph, CM, DM >
• deltaMap() : Circulation< _Graph, _LCapMap, _UCapMap, _DeltaMap, _Traits >
• derivate() : Polynomial< T >
• derivateMyself() : Polynomial< T >
• DescriptorMap() : DescriptorMap< _Graph, _Item >
• detach() : ObserverBase
• Dfs() : Dfs< GR, TR >
• DfsVisit() : DfsVisit< _Graph, _Visitor, _Traits >
• DfsWizard() : DfsWizard< TR >
• DfsWizardBase() : DfsWizardBase< GR >
• different() : Tolerance< T > , Tolerance< float > , Tolerance< double > , Tolerance< long double > , Tolerance< int > , Tolerance< unsigned int > , Tolerance< long int > , Tolerance< unsigned long int >
• Dijkstra() : Dijkstra< GR, LM, TR >
• DijkstraWizard() : DijkstraWizard< TR >
• DijkstraWizardBase() : DijkstraWizardBase< GR, LM >
• dimension() : HyperCubeGraph
• DinitzSleatorTarjan() : DinitzSleatorTarjan< _Graph, _CapacityMap, _Traits >
• direct() : BpUGraph , BaseUGraphComponent , UGraph , UndirGraphExtender< Base > , BpUGraph
• direction() : UndirGraphExtender< Base > , BpUGraph , BaseUGraphComponent , UGraph
• DirUGraphAdaptor() : DirUGraphAdaptor< _Graph, DirectionMap >
• disc() : Random
• discover() : DfsVisitor< _Graph > , BfsVisitor< _Graph >
• dist() : DagShortestPath< _Graph, _LengthMap, _Traits > , BellmanFord< _Graph, _LengthMap, _Traits > , Bfs< GR, TR > , Dfs< GR, TR > , Dijkstra< GR, LM, TR > , FloydWarshall< _Graph, _LengthMap, _Traits > , Johnson< _Graph, _LengthMap, _Traits >
• Dist() : DistLog
• Dist2() : DistLog2
• distantBWNodeTexts() : GraphToEps< T >
• distantColorNodeTexts() : GraphToEps< T >
• distMap() : Johnson< _Graph, _LengthMap, _Traits > , BfsWizard< TR > , DfsWizard< TR > , Dfs< GR, TR > , FloydWarshall< _Graph, _LengthMap, _Traits > , DijkstraWizard< TR > , DagShortestPathWizard< _Traits > , Bfs< GR, TR > , Dfs< GR, TR > , BellmanFord< _Graph, _LengthMap, _Traits > , BellmanFordWizard< _Traits > , DagShortestPath< _Graph, _LengthMap, _Traits > , DagShortestPathWizard< _Traits > , Bfs< GR, TR > , Dijkstra< GR, LM, TR > , FloydWarshall< _Graph, _LengthMap, _Traits > , Johnson< _Graph, _LengthMap, _Traits > , Dijkstra< GR, LM, TR >
• DivMap() : DivMap< M1, M2 >
• divMap() : DivMap< M1, M2 >
• doubleOption() : ArgParser
• down() : GridUGraph
• drawArrows() : GraphToEps< T >
• dual() : LpSolverBase
• DualExpr() : DualExpr
• DualIt() : DualIt
• dualSize() : MinCostArborescence< _Graph, _CostMap, _Traits >
• dualStatus() : LpSolverBase
• dualValue() : MaxWeightedMatching< _UGraph, _WeightMap > , MaxWeightedPerfectMatching< _UGraph, _WeightMap > , MinCostArborescence< _Graph, _CostMap, _Traits >
• dump() : DistLog , DistLog2
• DynamicAsymMatrixMap() : DynamicAsymMatrixMap< _FirstContainer, _FirstContainerItem, _SecondContainer, _SecondContainerItem, _Value >
• DynamicMatrixMap() : DynamicMatrixMap< _Graph, _Item, _Value >
• DynamicSymMatrixMap() : DynamicSymMatrixMap< _Graph, _Item, _Value >
• DynamicTree() : DynamicTree< _Value, _ItemIntMap, _Tolerance, _enableSize >
• DynEdgeLookUp() : DynEdgeLookUp< G >