Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::OptimalRanking Member List

This is the complete list of members for ogdf::OptimalRanking, including all inherited members.

call(const Graph &G, NodeArray< int > &rank) overrideogdf::OptimalRankingvirtual
call(const Graph &G, const EdgeArray< int > &length, NodeArray< int > &rank)ogdf::OptimalRanking
call(const Graph &G, const EdgeArray< int > &length, const EdgeArray< int > &cost, NodeArray< int > &rank) overrideogdf::OptimalRankingvirtual
doCall(const Graph &G, NodeArray< int > &rank, EdgeArray< bool > &reversed, const EdgeArray< int > &length, const EdgeArray< int > &cost)ogdf::OptimalRankingprivate
m_separateMultiEdgesogdf::OptimalRankingprivate
m_subgraphogdf::OptimalRankingprivate
operator()(const Graph &G, NodeArray< int > &rank)ogdf::RankingModuleinline
OptimalRanking()ogdf::OptimalRanking
RankingModule()ogdf::RankingModuleinline
separateMultiEdges() constogdf::OptimalRankinginline
separateMultiEdges(bool b)ogdf::OptimalRankinginline
setSubgraph(AcyclicSubgraphModule *pSubgraph)ogdf::OptimalRankinginline
~RankingModule()ogdf::RankingModuleinlinevirtual