tlp Namespace Reference
Detailed Description
This file is part of Tulip (www.tulip-software.org)
Authors: David Auber and the Tulip development Team from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
Tulip is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
Tulip is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
Classes
Typedefs
- typedef AbstractProperty<
ColorType, ColorType, ColorAlgorithm > AbstractColorProperty
- typedef AbstractProperty<
DoubleType, DoubleType, DoubleAlgorithm > AbstractDoubleProperty
- typedef AbstractProperty<
IntegerType, IntegerType,
IntegerAlgorithm > AbstractIntegerProperty
- typedef AbstractProperty<
PointType, LineType, LayoutAlgorithm > AbstractLayoutProperty
- typedef std::map< Observer *,
std::set< Observable * > > ObserverMap
- typedef std::map< Observable *,
std::set< Observer * > > ObservableMap
- typedef AbstractProperty<
SizeType, SizeType, SizeAlgorithm > AbstractSizeProperty
- typedef AbstractProperty<
StringType, StringType, StringAlgorithm > AbstractStringProperty
- typedef Vector< double, 2 > Vec2d
- typedef for 2D vector of double
- typedef Vector< double, 3 > Vec3d
- typedef for 3D vector of double
- typedef Vector< double, 4 > Vec4d
- typedef for 4D vector of double
- typedef Vector< float, 2 > Vec2f
- typedef for 2D vector of float
- typedef Vector< float, 3 > Vec3f
- typedef for 3D vector of float
- typedef Vector< float, 4 > Vec4f
- typedef for 4D vector of float
Enumerations
Functions
- template<typename Obj, unsigned int SIZE> std::ostream & operator<< (std::ostream &os, const Array< Obj, SIZE > &)
- template<typename Obj, unsigned int SIZE> std::istream & operator>> (std::istream &is, Array< Obj, SIZE > &)
- template<typename Obj> Circle< Obj > enclosingCircle (const Circle< Obj > &, const Circle< Obj > &)
- template<typename Obj> Circle< Obj > enclosingCircle (const std::vector< Circle< Obj > > &circles)
- template<typename Obj> Circle< Obj > lazyEnclosingCircle (const std::vector< Circle< Obj > > &circles)
- template<typename Obj> std::ostream & operator<< (std::ostream &os, const Circle< Obj > &)
- TLP_SCOPE std::ostream & operator<< (std::ostream &os, const tlp::Color &)
- TLP_SCOPE std::istream & operator>> (std::istream &is, tlp::Color &)
- TLP_SCOPE void convexHull (const std::vector< Coord > &points, std::vector< unsigned int > &convexHull)
- function for convex hull manipulation
- TLP_SCOPE void mergeHulls (const std::vector< Coord > &points, const std::vector< unsigned int > &hull1, const std::vector< unsigned int > &hull2, std::vector< unsigned int > &mergedConvexHull)
- TLP_SCOPE void intersectHulls (std::vector< Coord > &points, const std::vector< unsigned int > &hull1, const std::vector< unsigned int > &hull2, std::vector< unsigned int > &intersection)
- TLP_SCOPE double areaOfHull (const std::vector< Coord > &points, const std::vector< unsigned int > &hull)
- TLP_SCOPE bool insideHull (const std::vector< Coord > &points, const std::vector< unsigned int > &hull, const Coord &point)
- TLP_SCOPE void delaunayTriangulation (const std::vector< Coord > &points, std::vector< std::pair< unsigned int, unsigned int > > &edges)
- functions for Delaunay Triangulations
- void delaunayTriangulation (const std::vector< Coord > &points, std::vector< tlp::Array< unsigned int, 3 > > &triangles)
- void delaunayTriangulation (const std::vector< Coord > &points, std::vector< std::pair< unsigned int, unsigned int > > &edges, std::vector< tlp::Array< unsigned int, 3 > > &triangles)
- void voronoiDiagram (const std::vector< Coord > &points, VoronoiDiagram &voronoiDiagram, bool returnVoronoiEdgeList=false)
- TLP_SCOPE BoundingBox computeBoundingBox (const Graph *graph, const LayoutProperty *layout, const SizeProperty *size, const DoubleProperty *rotation, const BooleanProperty *selection=0)
- TLP_SCOPE std::pair< Coord,
Coord > computeBoundingRadius (const Graph *graph, const LayoutProperty *layout, const SizeProperty *size, const DoubleProperty *rotation, const BooleanProperty *selection=0)
- TLP_SCOPE std::vector< Coord > computeConvexHull (const Graph *graph, const LayoutProperty *layout, const SizeProperty *size, const DoubleProperty *rotation, const BooleanProperty *selection=0)
- void openMetaNode (Graph *graph, node n)
- node createMetaNode (Graph *graph, const std::set< node > &nodeSet)
- Graph * inducedSubGraph (Graph *graph, const std::set< node > &nodeSet)
- TLP_SCOPE Graph * loadGraph (const std::string &filename)
- TLP_SCOPE bool saveGraph (Graph *, const std::string &filename)
- TLP_SCOPE Graph * importGraph (const std::string &alg, DataSet &dataSet, PluginProgress *plugProgress=0, Graph *newGraph=0)
- TLP_SCOPE bool exportGraph (Graph *graph, std::ostream &os, const std::string &alg, DataSet &dataSet, PluginProgress *plugProgress=0)
- TLP_SCOPE bool applyAlgorithm (Graph *graph, std::string &errorMsg, DataSet *dataSet=0, const std::string &alg="any", PluginProgress *plugProgress=0)
- TLP_SCOPE Graph * newGraph ()
- TLP_SCOPE Graph * newSubGraph (Graph *, std::string name="unnamed")
- TLP_SCOPE Graph * newCloneSubGraph (Graph *, std::string name="unnamed")
- TLP_SCOPE bool getSource (Graph *, node &n)
- TLP_SCOPE void copyToGraph (Graph *outG, Graph *inG, BooleanProperty *inSelection=0, BooleanProperty *outSelection=0)
- TLP_SCOPE void removeFromGraph (Graph *ioG, BooleanProperty *inSelection=0)
- TLP_SCOPE double averagePathLength (const Graph *g, PluginProgress *=NULL)
- bool averagePathLength (Graph *g, double &result, PluginProgress *pp=NULL)
- TLP_SCOPE double averageClusteringCoefficient (const Graph *, PluginProgress *=0)
- bool averageCluster (Graph *g, double &result, PluginProgress *pp=NULL)
- TLP_SCOPE void clusteringCoefficient (const Graph *g, MutableContainer< double > &result, unsigned int maxDepth=UINT_MAX, PluginProgress *=NULL)
- TLP_SCOPE void dagLevel (const Graph *graph, MutableContainer< unsigned int > &level, PluginProgress *=NULL)
- TLP_SCOPE unsigned int maxDegree (const Graph *)
- TLP_SCOPE unsigned int minDegree (const Graph *)
- TLP_SCOPE unsigned int maxDistance (const Graph *graph, const node n, MutableContainer< unsigned int > &distance, EDGE_TYPE direction=UNDIRECTED)
- TLP_SCOPE void reachableNodes (const Graph *graph, const node startNode, std::set< node > &result, unsigned int maxDistance, EDGE_TYPE direction=UNDIRECTED)
- TLP_SCOPE std::vector< std::vector<
node > > computeCanonicalOrdering (PlanarConMap *, std::vector< edge > *dummyEdges=0, PluginProgress *pluginProgress=0)
- TLP_SCOPE std::vector< node > computeGraphCenters (Graph *graph)
- TLP_SCOPE node graphCenterHeuristic (Graph *graph)
- TLP_SCOPE node makeSimpleSource (Graph *graph)
- TLP_SCOPE void makeProperDag (Graph *graph, std::list< node > &addedNodes, TLP_HASH_MAP< edge, edge > &replacedEdges, IntegerProperty *edgeLength=0)
- TLP_SCOPE void selectSpanningForest (Graph *graph, BooleanProperty *selectionProperty, PluginProgress *pluginProgress=0)
- TLP_SCOPE void selectMinimumSpanningTree (Graph *graph, BooleanProperty *selectionProperty, DoubleProperty *weight=0, PluginProgress *pluginProgress=0)
- TLP_SCOPE bool computeEqualValueClustering (Graph *graph, PropertyInterface *property, bool onNodes=true, bool connected=false, PluginProgress *pluginProgress=0)
- TLP_SCOPE bool computeEqualValueClustering (Graph *graph, PropertyInterface *property, bool onNodes=true, PluginProgress *pluginProgress=0)
- template<typename Obj, unsigned int SIZE> MATRIX operator * (const MATRIX &mat, const Obj &obj)
- template<typename Obj, unsigned int SIZE> MATRIX operator * (const MATRIX &mat1, const MATRIX &mat2)
- template<typename Obj, unsigned int SIZE> Vector< Obj, SIZE > operator * (const Vector< Obj, SIZE > &vec, const tlp::Matrix< Obj, SIZE > &)
- template<typename Obj, unsigned int SIZE> Vector< Obj, SIZE > operator * (const Matrix< Obj, SIZE > &, const Vector< Obj, SIZE > &vec)
- template<typename TYPE> TYPE defaultTypeValue ()
- TLP_SCOPE void initTulipLib (char *appDirPath=0)
- TLP_SCOPE void loadPlugins (PluginLoader *plug=0)
- TLP_SCOPE bool loadPlugin (const std::string &filename, PluginLoader *plug=0)
- TLP_SCOPE void loadPluginsFromDir (std::string dir, std::string type, PluginLoader *loader=0)
- TLP_SCOPE void loadPluginsCheckDependencies (PluginLoader *loader=0)
- TLP_SCOPE std::string demangleTlpClassName (const char *className)
- TLP_SCOPE std::istream * getIgzstream (const char *name, int open_mode=std::ios::in)
- TLP_SCOPE std::ostream * getOgzstream (const char *name, int open_mode=std::ios::out)
- TLP_SCOPE std::string getMajor (const std::string &release)
- TLP_SCOPE std::string getMinor (const std::string &release)
- bool stringToColor (std::string &str, Color &col)
- bool stringToSize (std::string &str, Size &siz)
- bool stringToCoord (std::string &str, Coord &coo)
- bool stringToLCoord (std::string &str, std::list< Coord > &lcoo)
- bool stringToNodeProperty (PropertyInterface *propertyName, node n, std::string &str)
- bool stringToEdgeProperty (PropertyInterface *propertyName, edge e, std::string &str)
- bool stringToAllNodeProperty (PropertyInterface *propertyName, std::string &str)
- bool stringToAllEdgeProperty (PropertyInterface *propertyName, std::string &str)
- std::string nodePropertyToString (PropertyInterface *propertyName, node n)
- std::string edgePropertyToString (PropertyInterface *propertyName, edge e)
- std::string propertyType (PropertyInterface *propertyName)
- std::string propertyNodeDefaultValue (PropertyInterface *propertyName)
- std::string propertyEdgeDefaultValue (PropertyInterface *propertyName)
- DECL_STORED_STRUCT (std::set< node >)
- DECL_STORED_STRUCT (std::set< edge >)
- DECL_STORED_STRUCT (std::vector< double >)
- DECL_STORED_STRUCT (std::vector< int >)
- DECL_STORED_STRUCT (std::vector< bool >)
- DECL_STORED_STRUCT (std::vector< Coord >)
- DECL_STORED_STRUCT (Size)
- DECL_STORED_STRUCT (std::vector< Size >)
- DECL_STORED_STRUCT (std::string)
- DECL_STORED_STRUCT (std::vector< std::string >)
- DECL_STORED_STRUCT (std::vector< Color >)
- TEMPLATEVECTOR VECTOR minVector (const VECTOR &u, const VECTOR &v)
- TEMPLATEVECTOR VECTOR maxVector (const VECTOR &u, const VECTOR &v)
- TEMPLATEVECTOR VECTOR operator * (const VECTOR &, const VECTOR &)
- TEMPLATEVECTOR VECTOR operator * (const TYPE &, const VECTOR &)
- TEMPLATEVECTOR VECTOR operator * (const VECTOR &, const TYPE &)
- TEMPLATEVECTOR VECTOR operator+ (const VECTOR &, const VECTOR &)
- TEMPLATEVECTOR VECTOR operator+ (const VECTOR &, const TYPE &)
- TEMPLATEVECTOR VECTOR operator- (const VECTOR &, const VECTOR &)
- TEMPLATEVECTOR VECTOR operator- (const VECTOR &, const TYPE &)
- TEMPLATEVECTOR VECTOR operator/ (const VECTOR &, const VECTOR &)
- TEMPLATEVECTOR VECTOR operator/ (const VECTOR &, const TYPE &)
- TEMPLATEVECTOR VECTOR operator^ (const VECTOR &, const VECTOR &)
- TEMPLATEVECTOR VECTOR operator- (const VECTOR &)
Variables
Typedef Documentation
Enumeration Type Documentation
|
- Enumerator:
-
DIRECTED |
|
INV_DIRECTED |
|
UNDIRECTED |
|
|
|
- Enumerator:
-
TLP_CONTINUE |
|
TLP_CANCEL |
|
TLP_STOP |
|
|
Function Documentation
TLP_SCOPE bool tlp::applyAlgorithm |
( |
Graph * |
graph, |
|
|
std::string & |
errorMsg, |
|
|
DataSet * |
dataSet = 0 , |
|
|
const std::string & |
alg = "any" , |
|
|
PluginProgress * |
plugProgress = 0 |
|
) |
|
|
bool tlp::averageCluster |
( |
Graph * |
g, |
|
|
double & |
result, |
|
|
PluginProgress * |
pp = NULL |
|
) |
[inline] |
|
TLP_SCOPE double tlp::averageClusteringCoefficient |
( |
const Graph * |
, |
|
|
PluginProgress * |
= 0 |
|
) |
|
|
bool tlp::averagePathLength |
( |
Graph * |
g, |
|
|
double & |
result, |
|
|
PluginProgress * |
pp = NULL |
|
) |
[inline] |
|
TLP_SCOPE double tlp::averagePathLength |
( |
const Graph * |
g, |
|
|
PluginProgress * |
= NULL |
|
) |
|
|
|
returns the average path lengh of a graph, that is the sum of the shortest distances for all pair of distinct nodes in that graph divided by the number of those pairs. For a pair of non connected nodes, the shorted distance is set to 0. see http://en.wikipedia.org/wiki/Average_path_length for more details |
TLP_SCOPE void tlp::clusteringCoefficient |
( |
const Graph * |
g, |
|
|
MutableContainer< double > & |
result, |
|
|
unsigned int |
maxDepth = UINT_MAX , |
|
|
PluginProgress * |
= NULL |
|
) |
|
|
TLP_SCOPE BoundingBox tlp::computeBoundingBox |
( |
const Graph * |
graph, |
|
|
const LayoutProperty * |
layout, |
|
|
const SizeProperty * |
size, |
|
|
const DoubleProperty * |
rotation, |
|
|
const BooleanProperty * |
selection = 0 |
|
) |
|
|
|
Compute the bounding box of a graph according to node position edge bends node z-rotation, and size of elements |
TLP_SCOPE std::pair<Coord, Coord> tlp::computeBoundingRadius |
( |
const Graph * |
graph, |
|
|
const LayoutProperty * |
layout, |
|
|
const SizeProperty * |
size, |
|
|
const DoubleProperty * |
rotation, |
|
|
const BooleanProperty * |
selection = 0 |
|
) |
|
|
|
Compute a bounding sphere of a graph according to node position edge bends node z-rotation, and size of elements
- Todo:
- make that fucntion return a new type of class called BoundingSphere
test if that function correctly compute a bounding sphere.
|
TLP_SCOPE std::vector<std::vector<node> > tlp::computeCanonicalOrdering |
( |
PlanarConMap * |
, |
|
|
std::vector< edge > * |
dummyEdges = 0 , |
|
|
PluginProgress * |
pluginProgress = 0 |
|
) |
|
|
|
This ordering was first introduced by C. Gutwenger and P. Mutzel in
"Grid embeddings of biconnected planar graphs",
"Extended Abstract, Max-Planck-Institut für Informatik,"
"Saarbrücken, Germany, 1997"
Let n be the number of nodes, the original algorithm complexity is in O(n).
But the implementation of the canonical ordering has not been made in O(n).
|
TLP_SCOPE std::vector<Coord> tlp::computeConvexHull |
( |
const Graph * |
graph, |
|
|
const LayoutProperty * |
layout, |
|
|
const SizeProperty * |
size, |
|
|
const DoubleProperty * |
rotation, |
|
|
const BooleanProperty * |
selection = 0 |
|
) |
|
|
|
Compute a convexHull of a graph according to node position edge bends node z-rotation, and size of elements. Only works in 2D. - Todo:
- refactor code from GlConvexHull here
|
TLP_SCOPE bool tlp::computeEqualValueClustering |
( |
Graph * |
graph, |
|
|
PropertyInterface * |
property, |
|
|
bool |
onNodes = true , |
|
|
PluginProgress * |
pluginProgress = 0 |
|
) |
|
|
|
Compute the subgraphs whose elements have the same value for property This one is an obsolete version (should be remove in 3.1); use the previous one |
TLP_SCOPE bool tlp::computeEqualValueClustering |
( |
Graph * |
graph, |
|
|
PropertyInterface * |
property, |
|
|
bool |
onNodes = true , |
|
|
bool |
connected = false , |
|
|
PluginProgress * |
pluginProgress = 0 |
|
) |
|
|
|
Compute the subgraphs whose elements have the same value for property |
TLP_SCOPE std::vector<node> tlp::computeGraphCenters |
( |
Graph * |
graph |
) |
|
|
|
Find all the graph centers, that version does not manage edge weight. complexity O(n * m). Only works on connected graphs. |
TLP_SCOPE void tlp::copyToGraph |
( |
Graph * |
outG, |
|
|
Graph * |
inG, |
|
|
BooleanProperty * |
inSelection = 0 , |
|
|
BooleanProperty * |
outSelection = 0 |
|
) |
|
|
|
Append the selected part of the graph inG (properties, nodes & edges) into the graph outG. If no selection is done (inSel=NULL), the whole inG graph is appended. The output selection is used to select the appended nodes & edges - Warning:
- The input selection is extended to all selected edge ends.
|
node tlp::createMetaNode |
( |
Graph * |
graph, |
|
|
const std::set< node > & |
nodeSet |
|
) |
[inline] |
|
|
Function to close a subgraph into a metanode. Edges from nodes in the subgraph to nodes outside the subgraph are replaced with edges from the metanode to the nodes outside the subgraph. |
TLP_SCOPE void tlp::dagLevel |
( |
const Graph * |
graph, |
|
|
MutableContainer< unsigned int > & |
level, |
|
|
PluginProgress * |
= NULL |
|
) |
|
|
template<typename TYPE> |
TYPE tlp::defaultTypeValue |
( |
|
) |
[inline] |
|
TLP_SCOPE std::string tlp::demangleTlpClassName |
( |
const char * |
className |
) |
|
|
|
returns the demangled name of a C++ class defines in the tlp namespace. The tlp:: prefix is omitted and the returned pointer do not have to be deallocated. |
TLP_SCOPE bool tlp::exportGraph |
( |
Graph * |
graph, |
|
|
std::ostream & |
os, |
|
|
const std::string & |
alg, |
|
|
DataSet & |
dataSet, |
|
|
PluginProgress * |
plugProgress = 0 |
|
) |
|
|
TLP_SCOPE std::istream* tlp::getIgzstream |
( |
const char * |
name, |
|
|
int |
open_mode = std::ios::in |
|
) |
|
|
TLP_SCOPE std::string tlp::getMajor |
( |
const std::string & |
release |
) |
|
|
|
Extracts Major number from a release number |
TLP_SCOPE std::string tlp::getMinor |
( |
const std::string & |
release |
) |
|
|
|
Extracts Minor number from a release number |
TLP_SCOPE std::ostream* tlp::getOgzstream |
( |
const char * |
name, |
|
|
int |
open_mode = std::ios::out |
|
) |
|
|
|
Returns an ostream to write to a gzipped file (uses gzstream lib) the stream has to be deleted after use. - Warning:
- Don't forget to check the stream with ios::bad()!
|
TLP_SCOPE bool tlp::getSource |
( |
Graph * |
, |
|
|
node & |
n |
|
) |
|
|
|
find the first node of degree 0, if no node exist return false else true |
TLP_SCOPE node tlp::graphCenterHeuristic |
( |
Graph * |
graph |
) |
|
|
|
return a node that can be considered as the graph center. It is an heuristic, thus it is not absolutely sure that this node is a graph center. Only works on connected graphs. |
TLP_SCOPE Graph* tlp::importGraph |
( |
const std::string & |
alg, |
|
|
DataSet & |
dataSet, |
|
|
PluginProgress * |
plugProgress = 0 , |
|
|
Graph * |
newGraph = 0 |
|
) |
|
|
Graph* tlp::inducedSubGraph |
( |
Graph * |
graph, |
|
|
const std::set< node > & |
nodeSet |
|
) |
[inline] |
|
|
Return the subgraph induced by a set of nodes |
TLP_SCOPE void tlp::initTulipLib |
( |
char * |
appDirPath = 0 |
) |
|
|
TLP_SCOPE Graph* tlp::loadGraph |
( |
const std::string & |
filename |
) |
|
|
|
Load a graph in the tlp format Warning : this function use "tlp" import plugin (must be laoded) |
TLP_SCOPE bool tlp::loadPlugin |
( |
const std::string & |
filename, |
|
|
PluginLoader * |
plug = 0 |
|
) |
|
|
TLP_SCOPE void tlp::loadPlugins |
( |
PluginLoader * |
plug = 0 |
) |
|
|
TLP_SCOPE void tlp::loadPluginsCheckDependencies |
( |
PluginLoader * |
loader = 0 |
) |
|
|
TLP_SCOPE void tlp::loadPluginsFromDir |
( |
std::string |
dir, |
|
|
std::string |
type, |
|
|
PluginLoader * |
loader = 0 |
|
) |
|
|
TLP_SCOPE void tlp::makeProperDag |
( |
Graph * |
graph, |
|
|
std::list< node > & |
addedNodes, |
|
|
TLP_HASH_MAP< edge, edge > & |
replacedEdges, |
|
|
IntegerProperty * |
edgeLength = 0 |
|
) |
|
|
TLP_SCOPE node tlp::makeSimpleSource |
( |
Graph * |
graph |
) |
|
|
|
return a new node connected to all previously existing nodes which had a null indegree |
TLP_SCOPE unsigned int tlp::maxDegree |
( |
const Graph * |
|
) |
|
|
TLP_SCOPE unsigned int tlp::maxDistance |
( |
const Graph * |
graph, |
|
|
const node |
n, |
|
|
MutableContainer< unsigned int > & |
distance, |
|
|
EDGE_TYPE |
direction = UNDIRECTED |
|
) |
|
|
TLP_SCOPE unsigned int tlp::minDegree |
( |
const Graph * |
|
) |
|
|
TLP_SCOPE Graph* tlp::newCloneSubGraph |
( |
Graph * |
, |
|
|
std::string |
name = "unnamed" |
|
) |
|
|
|
Return a subgraph equal to the graph given in parameter (a clone subgraph) |
TLP_SCOPE Graph* tlp::newGraph |
( |
|
) |
|
|
TLP_SCOPE Graph* tlp::newSubGraph |
( |
Graph * |
, |
|
|
std::string |
name = "unnamed" |
|
) |
|
|
void tlp::openMetaNode |
( |
Graph * |
graph, |
|
|
node |
n |
|
) |
[inline] |
|
|
Function to open a metanode and replace all edges between that meta node and other nodes in the graph. |
TLP_SCOPE std::ostream& tlp::operator<< |
( |
std::ostream & |
os, |
|
|
const tlp::Color & |
|
|
) |
|
|
TLP_SCOPE std::istream& tlp::operator>> |
( |
std::istream & |
is, |
|
|
tlp::Color & |
|
|
) |
|
|
TLP_SCOPE void tlp::reachableNodes |
( |
const Graph * |
graph, |
|
|
const node |
startNode, |
|
|
std::set< node > & |
result, |
|
|
unsigned int |
maxDistance, |
|
|
EDGE_TYPE |
direction = UNDIRECTED |
|
) |
|
|
TLP_SCOPE void tlp::removeFromGraph |
( |
Graph * |
ioG, |
|
|
BooleanProperty * |
inSelection = 0 |
|
) |
|
|
|
Remove the selected part of the graph ioG (properties, nodes & edges). If no selection is done (inSel=NULL), the whole graph is reseted to default value. - Warning:
- The selection is extended to all selected edge ends.
|
TLP_SCOPE bool tlp::saveGraph |
( |
Graph * |
, |
|
|
const std::string & |
filename |
|
) |
|
|
|
Save a graph in tlp format Warning : this function use "tlp" export plugin (must be laoded) |
TLP_SCOPE void tlp::selectMinimumSpanningTree |
( |
Graph * |
graph, |
|
|
BooleanProperty * |
selectionProperty, |
|
|
DoubleProperty * |
weight = 0 , |
|
|
PluginProgress * |
pluginProgress = 0 |
|
) |
|
|
|
Select the minimum spanning tree (Kruskal algorithm) of a weighted graph, i.e for all graph elements (nodes or edges) belonging to that tree the selectionProperty associated value is true. The value is false for the other elements |
TLP_SCOPE void tlp::selectSpanningForest |
( |
Graph * |
graph, |
|
|
BooleanProperty * |
selectionProperty, |
|
|
PluginProgress * |
pluginProgress = 0 |
|
) |
|
|
|
Select a spanning forest of the graph, i.e for all graph elements (nodes or edges) belonging to that forest the selectionProperty associated value is true. The value is false for the other elements |
Variable Documentation
|