Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T > Member List

This is the complete list of members for ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >, including all inherited members.

addNewPath(DWMData &result, node curr, const NodeArray< edge > &pred) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
call(int restricted)ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inline
computePartialSolutions(const CONTAINER &targets)ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
computeSplit(NodeArray< DWMSplit > &split, node v, SubsetEnumerator< node > &subset) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
costOf(const List< node > &key) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
dataOf(const List< node > &key) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
FullComponentGeneratorDreyfusWagnerWithoutMatrix(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal)ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inline
getSteinerTreeFor(const DWMData &data, EdgeWeightedGraphCopy< T > &tree) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
getSteinerTreeFor(const List< node > &terminals, EdgeWeightedGraphCopy< T > &tree) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inline
initializeMap()ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
insertBestSubtrees(const CONTAINER &targets, const NodeArray< DWMSplit > &split, const NodeArray< edge > &pred, const NodeArray< T > &distance, const List< node > &terminals)ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
insertInvalidBestSubtree(node v, const NodeArray< T > &distance, const List< node > &newSubset)ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
insertValidBestSubtree(node v, const NodeArray< DWMSplit > &split, const NodeArray< edge > &pred, const List< node > &newSubset, const List< node > &terminals)ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
isValidComponent(const EdgeWeightedGraphCopy< T > &tree) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inline
m_auxGogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >private
m_Gogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >private
m_isTerminalogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >private
m_mapogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >private
m_terminalsogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >private
m_terminalSubsetogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >private
makeKey(List< node > &newSubset, node v) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
makeKey(List< node > &newSubset, List< node > &newComplement, const SubsetEnumerator< node > &subset, node v) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
safeIfSumSmaller(const T summand1, const T summand2, const T compareValue) constogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate
sortedInserter(node w, List< node > &list, bool &inserted, node newNode)ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivatestatic
updateAuxGraph(NodeArray< DWMSplit > &split, SubsetEnumerator< node > &subset, T oldCost)ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >inlineprivate