---
name: "GraphTools.h"
section: "3tulip"
platform: "linux"
package: "tulip-doc"
version: "3.1.2-2.3"
release: "Debian 6.0 (Squeeze)"
platforms: ["linux"]
url: "https://new.carta.tech/GraphTools.h"
---

# GraphTools.h(3tulip)

## NAME

GraphTools.h -

## SYNOPSIS

`#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)\

## Author

Generated automatically by Doxygen for Tulip Graph Library from the source code.