GraphTools.h3tulip

#include <tulip/Node.h>
#include <tulip/Edge.h>
#include <set>
#include <list>
#include <tulip/PlanarConMap.h>

Namespaces

namespace tlp

Functions

TLP_SCOPE std::vector< std::vector< node > > tlp::computeCanonicalOrdering (PlanarConMap *, std::vector< edge > *dummyEdges=0, PluginProgress *pluginProgress=0)
TLP_SCOPE std::vector< node > tlp::computeGraphCenters (Graph *graph)
TLP_SCOPE node tlp::graphCenterHeuristic (Graph *graph)
TLP_SCOPE node tlp::makeSimpleSource (Graph *graph)
TLP_SCOPE void tlp::makeProperDag (Graph *graph, std::list< node > &addedNodes, stdext::hash_map< edge, edge > &replacedEdges, IntegerProperty *edgeLength=0)
TLP_SCOPE void tlp::selectSpanningForest (Graph *graph, BooleanProperty *selectionProperty, PluginProgress *pluginProgress=0)
TLP_SCOPE void tlp::selectMinimumSpanningTree (Graph *graph, BooleanProperty *selectionProperty, DoubleProperty *weight=0, PluginProgress *pluginProgress=0)
TLP_SCOPE bool tlp::computeEqualValueClustering (Graph *graph, PropertyInterface *property, bool onNodes=true, bool connected=false, PluginProgress *pluginProgress=0)
TLP_SCOPE bool tlp::computeEqualValueClustering (Graph *graph, PropertyInterface *property, bool onNodes=true, PluginProgress *pluginProgress=0)