Overview     Modules     Class Hierarchy     Classes     Members  

Tulip Plugins Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
AdjacencyMatrixImportAdjacencyMatrixImport.cpp - Import a graph coded with matrix
angle
ArityMetricArityMetric.h - Compute the degree of each node
AutoSizeAutoSize.cpp - Compute size in order to prevent node-node overlapping
BetweennessCentralityBetweeness centrality - An implementation of the betweeness centrality parameter
BiconnectedComponnentBicconnectedComponent.h - An implementation of the biconnected component decompostion algorithm
Billboard
BubbleTreeBubbleTree.h - An implementation of the bubble tree algorithm
Circle
CircularCircular.h - An implementation of a circurlar layout
ClusterMetricClusterMetric.h - An implementation of the clustering parameter
CompleteGraph
CompleteTree
Cone
ConeTreeExtendedConeTreeExtended.h - An implementation of the cone tree layout
ConnectedAndTreeComponentConnectedAndTreeComponent.h - Conected componnent and tree component decomposition
ConnectedComponentConnectedComponent.h - An implementation of the connected component algorithm
ConnectedComponnentPacking
ConvolutionClustering
ConvolutionClusteringSetup
std::couple
Cube
CubeOutLinedTransparent
Cylinder
DagLevelMetricDagLevelMeric.h - An implementation of DAG layer decomposition
Dendrogram
DepthMetricDepthMetric.h - This plugins compute for each node n, the maximum path-length between n and the other node
DOT_ATTR
DOT_YY
DOT_YYType
DotImportDotImport.cpp - Import a graph coded in dot format
EccentricityMetricEccentricyMetric.h - Compute the eccentricity of each node
Edge
edgeS
EmbedderEmbedder.cpp - An implementation of the HDE algorithm
std::equal_to< couple >
EqualValueClustering
FileSystem
FitToLabelFitToLabel.cpp - Compute size of elements according to the size of the displayed label
GEMLayout
GeneralGraph3DGeneralGraph3D.h - An implementation of a hierarchical graph drawing algorithm in 3D
GML
GMLBuilder
GMLEdgeBuilder
GMLEdgeGraphicsBuilder
GMLEdgeGraphicsLineBuilder
GMLEdgeGraphicsLinePointBuilder
GMLFalse
GMLGraphBuilder
GMLImport
GMLNodeBuilder
GMLNodeGraphicsBuilder
GMLParser< displayComment >
GMLTokenParser
GMLTrue
GMLValue
GMLWriter
greaterRadius
GreaterStackEval
Grid
HalfCylinder
stdext::hash< double >
heap
Hexagone
HierarchicalClustering
HierarchicalGraphHierarchical.h - An implementation of hierarchical graph drawing algorithm
IdLabels
IdMetricIdDoubleMetric.h - This plugins assigns id to nodes and edges
ImprovedWalker
ImprovedWalkerIterator
InducedSubGraphSelectionThis selection plugins enables to find a subgraph induced by a set of nodes
KruskalThis selection plugins implements the so called Kruskal algorithm. This algorithm enables to find a minimum spanning tree in a connected graph
LabelSelection
LeafMetricLeafMetric.h - Compute the number of leaves in the subtree induced by each node
std::less< couple >
std::less< Edge >
std::less< edgeS >
std::less< edgeS >
LessThan
LessThanEdge
LessThanNode2
LessThanNodos
LongestPath
LoopSelectionThis selection plugins enables to find loops in a graph
LR
MapParam
MetricColorMapping
MetricMappingMetricMapping.h - Compute size of elements according to a metric
MixedModelMixedModel.h- An implementation of a polyline graph drawing
MultipleEdgeSelectionThis selection plugins enables to find the multiple-edges and parallel-edges in a graph
NodeInfo
NodeMetricNodeMetric.h - Compute the number of nodes in the subtree induced by each node
Number
OnValueSelection
OrientableCoord
OrientableLayout
OrientableLayoutInterface
OrientableSize
OrientableSizeProxy
ParserError
PathLengthMetric
PathSelection
Pentagone
PlanarFPP
PlanarGraph
Point
Queue
QuotientClustering
RandomRandom.h - An implementation of a random 3D layout
RandomGraph
RandomMetricRandomMetric.h - This plugins assigns random values to nodes and edges
RandomSimpleGraph
RandomTree
RandomTreeGeneral
ReachableSubGraphSelection
RectanglePacking
RectangleRelativePosition
RectangleRelativePositionList
Ring
ScatterPlot
SegmentMetric
ShapeAttr
SmallWorldGraph
SpanningDagSelectionThis selection plugins enables to find a subgraph of G that is acyclic
SpanningTreeSelectionThis selection plugins enables to find a subgraph of G that is a forest (a set of trees)
Sphere
SpringElectrical
Square
SquareBorder
  • An implementation of square with variable border glyph
SquareBorderTex
  • An implementation of square with variable border glyph
SquareBorderTex::TreeCache
SquarifiedTreeMapSquarifiedTreeMap.h - An implementation of a squarified treemap layout
StackEval
Strahler
StrahlerMetricStrahlerMetric.h - An implementation of the Strahler parameter
StrengthClustering
StrengthMetricStrengthMetric.h - An implementation of the strength parameter
StrongComponentStrongComponent.h - An implementation of the Stongly connected component algorithm
TreeArityMaxTreeArityMax.h - Compute the maximum outdegree of the nodes in the subtree induced by each node
TreeLeafTreeLeaf.h - An implementation of a simple tree layout
TreeMapTreeMap.h - An implementation of the tree map layout
TreeRadialTreeRadial.cpp - An implementation of radial drawing of trees
TreeRadialExtended
TreeReingoldAndTilfordExtendedTreeReingoldAndTilfordExtended.h - An implementation of a hierarchical tree layout
Triangle
TutteTutte.h - An implementation of a 3-Connected graph layout
vtx_data
X11Color
yy_buffer_state
yyalloc


Tulip Software by David AUBER    2001 - 2006