AdjacencyMatrixImport | AdjacencyMatrixImport.cpp - Import a graph coded with matrix |
angle | |
ArityMetric | ArityMetric.h - Compute the degree of each node |
AutoSize | AutoSize.cpp - Compute size in order to prevent node-node overlapping |
BetweennessCentrality | Betweeness centrality - An implementation of the betweeness centrality parameter |
BiconnectedComponnent | BicconnectedComponent.h - An implementation of the biconnected component decompostion algorithm |
Billboard | A 2D glyph |
BubbleTree | BubbleTree.h - An implementation of the bubble tree algorithm |
Circle | A 2D glyph |
Circular | Circular.h - An implementation of a circurlar layout |
ClusterMetric | ClusterMetric.h - An implementation of the clustering parameter |
CompleteGraph | |
CompleteTree | |
Cone | A 3D glyph |
ConeTreeExtended | ConeTreeExtended.h - An implementation of the cone tree layout |
ConnectedAndTreeComponent | ConnectedAndTreeComponent.h - Conected componnent and tree component decomposition |
ConnectedComponent | ConnectedComponent.h - An implementation of the connected component algorithm |
ConnectedComponnentPacking | |
ConvolutionClustering | |
ConvolutionClusteringSetup | |
std::couple | |
Cube | A 3D glyph |
CubeOutLinedTransparent | A 3D glyph |
Cylinder | A 3D glyph |
DagLevelMetric | DagLevelMeric.h - An implementation of DAG layer decomposition |
Dendrogram | |
DepthMetric | DepthMetric.h - This plugins compute for each node n, the maximum path-length between n and the other node |
DOT_ATTR | |
DOT_YY | |
DOT_YYType | |
DotImport | DotImport.cpp - Import a graph coded in dot format |
EccentricityMetric | EccentricyMetric.h - Compute the eccentricity of each node |
Edge | |
edgeS | |
Embedder | Embedder.cpp - An implementation of the HDE algorithm |
std::equal_to< couple > | |
EqualValueClustering | |
FileSystem | |
FitToLabel | FitToLabel.cpp - Compute size of elements according to the size of the displayed label |
GEMLayout | |
GeneralGraph3D | GeneralGraph3D.h - An implementation of a hierarchical graph drawing algorithm in 3D |
GML | Export plugin for GML format |
GMLBuilder | |
GMLEdgeBuilder | |
GMLEdgeGraphicsBuilder | |
GMLEdgeGraphicsLineBuilder | |
GMLEdgeGraphicsLinePointBuilder | |
GMLFalse | |
GMLGraphBuilder | |
GMLImport | Import plugin for GML format |
GMLNodeBuilder | |
GMLNodeGraphicsBuilder | |
GMLParser< displayComment > | |
GMLTokenParser | |
GMLTrue | |
GMLValue | |
GMLWriter | |
greaterRadius | |
GreaterStackEval | |
Grid | |
HalfCylinder | A 3D glyph |
stdext::hash< double > | |
heap | |
Hexagone | A 2D glyph |
HierarchicalClustering | |
HierarchicalGraph | Hierarchical.h - An implementation of hierarchical graph drawing algorithm |
HistogramWidget | |
IdLabels | |
IdMetric | IdDoubleMetric.h - This plugins assigns id to nodes and edges |
ImprovedWalker | |
ImprovedWalkerIterator | |
InducedSubGraphSelection | This selection plugins enables to find a subgraph induced by a set of nodes |
Kruskal | This selection plugins implements the so called Kruskal algorithm. This algorithm enables to find a minimum spanning tree in a connected graph |
LabelSelection | |
LeafMetric | LeafMetric.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 | |
LoopSelection | This selection plugins enables to find loops in a graph |
LR | |
MapParam | |
MetricColorMapping | |
MetricMapping | MetricMapping.h - Compute size of elements according to a metric |
MixedModel | MixedModel.h- An implementation of a polyline graph drawing |
MultipleEdgeSelection | This selection plugins enables to find the multiple-edges and parallel-edges in a graph |
NodeInfo | |
NodeMetric | NodeMetric.h - Compute the number of nodes in the subtree induced by each node |
Number | |
OnValueSelection | |
OrientableCoord | |
OrientableLayout | |
OrientableLayoutInterface | |
OrientableSize | |
OrientableSizeProxy | |
ParserError | |
PathLengthMetric | |
PathSelection | |
Pentagone | A 2D glyph |
PlanarFPP | |
PlanarGraph | |
Point | |
Queue | |
QuotientClustering | |
Random | Random.h - An implementation of a random 3D layout |
RandomGraph | |
RandomMetric | RandomMetric.h - This plugins assigns random values to nodes and edges |
RandomSimpleGraph | |
RandomTree | |
RandomTreeGeneral | |
ReachableSubGraphSelection | |
RectanglePacking | |
RectangleRelativePosition | |
RectangleRelativePositionList | |
Ring | A 2D glyph |
ScatterPlot | |
SegmentMetric | |
ShapeAttr | |
SmallWorldGraph | |
SpanningDagSelection | This selection plugins enables to find a subgraph of G that is acyclic |
SpanningTreeSelection | This selection plugins enables to find a subgraph of G that is a forest (a set of trees) |
Sphere | A 3D glyph |
SpringElectrical | |
Square | A 2D glyph |
SquareBorder |
|
SquareBorderTex |
|
SquareBorderTex::TreeCache | |
SquarifiedTreeMap | SquarifiedTreeMap.h - An implementation of a squarified treemap layout |
StackEval | |
Strahler | |
StrahlerMetric | StrahlerMetric.h - An implementation of the Strahler parameter |
StrengthClustering | |
StrengthMetric | StrengthMetric.h - An implementation of the strength parameter |
StrongComponent | StrongComponent.h - An implementation of the Stongly connected component algorithm |
TreeArityMax | TreeArityMax.h - Compute the maximum outdegree of the nodes in the subtree induced by each node |
TreeLeaf | TreeLeaf.h - An implementation of a simple tree layout |
TreeMap | TreeMap.h - An implementation of the tree map layout |
TreeRadial | TreeRadial.cpp - An implementation of radial drawing of trees |
TreeRadialExtended | |
TreeReingoldAndTilfordExtended | TreeReingoldAndTilfordExtended.h - An implementation of a hierarchical tree layout |
Triangle | |
Tutte | Tutte.h - An implementation of a 3-Connected graph layout |
vtx_data | |
X11Color | |
yy_buffer_state | |
yyalloc |