Tulip
6.0.0
Large graphs analysis and drawing
|
Ctlp::AcyclicTest | This class provides tests for acyclicity on a graph. Results are cached in a map of graphs and result. This class observes the graphs that have been tested to remove the result from this graph if it is modified. This forces the use of the singleton pattern instead of simply using static functions/members |
Ctlp::BiconnectedTest | Performs a test of biconnexity on the graph, and provides a function to make a graph biconnected. From Wikipedia: "A biconnected graph is connected and nonseparable, meaning that if any vertex were to be removed, the graph will remain connected." |
Ctlp::BoundingBox | This class represents the 3D bounding box of an object. It is mostly used to determine whether or not two object are in a state of collision |
Ctlp::ConnectedTest | Performs a test of connexity on the graph, and provides a function to make a graph connected. From Wikipedia: "A graph is said to be connected if every pair of vertices in the graph are connected." (i.e. there is a path between every pair of vertices) |
Ctlp::DataSet | A container that can store data from any type |
Ctlp::DataType | Describes a value of any type |
Ctlp::edge | The edge struct represents an edge in a Graph object |
Ctlp::PropertyInterface::edgeStringValueRef | Inner class used to overload the operator[] to set an edge string value |
Ctlp::AbstractProperty< Tnode, Tedge, Tprop >::edgeValueRef | Inner class used to overload the operator[] to set an edge value |
▼Ctlp::Event | Event is the base class for all events used in the Observation mechanism |
Ctlp::GraphEvent | |
Ctlp::PropertyEvent | Contains additional information about events on a property, such as the property it happened on, the node/edge eventually concerned and such. It also contains the detailed type of the event |
Ctlp::GlBezierCurve | A class to draw Bezier curves |
Ctlp::GlCatmullRomCurve | A class to draw a Catmull-Rom curve |
Ctlp::GlGraphRenderer | Class used by GlGraphComposite to render the graph in OpenGL |
Ctlp::GlGraphRenderingParameters | That class defines all the parameters used by GlGraphComposite to render a graph |
Ctlp::GLInteractorComponent | InteractorComponent that can do OpenGL rendering on a GlMainWidget |
Ctlp::GlLayer | A GlLayer is like an 2D drawing software layer system |
Ctlp::GlMainWidget | This widget provide a simple system to visualize data/graph with OpenGL 3D engine |
Ctlp::GlOpenUniformCubicBSpline | A class to draw open uniform cubic B-splines |
▼Ctlp::GlSimpleEntity | Base class for all Tulip OpenGL entities |
▼Ctlp::GlAbstractPolygon | Class to create a abstract polygon |
►Ctlp::GlPolygon | Class to create a polygon GlEntity |
Ctlp::GlBox | General class used to render boxes as GlSimpleEntity |
▼Ctlp::GlComplexPolygon | Class to create a complex polygon (concave polygon or polygon with hole) If you want to create a complex polygon you have 4 constructors : Constructors with vector of coords : to create a complex polygon without hole |
Ctlp::GlStar | Class to create a star |
▼Ctlp::GlComposite | GlSimpleEntity used to aggregate other GlEntity |
Ctlp::GlAxis | A base class to draw an axis with graduations |
Ctlp::GlGraphComposite | Class use to visualize graph in OpenGL Tulip engine |
Ctlp::GlGrid | General class used to render grids as GlSimpleEntity |
Ctlp::GlLabel | Create a label into Tulip 3D engine |
Ctlp::GlSphere | Class to create a sphere with GlEntity system |
Ctlp::ImportGraphObserver | New graph observation |
▼Ctlp::Iterator< T > | Interface for Tulip iterators. Allows basic iteration operations only |
▼Ctlp::ConversionIterator< TIN, TOUT, ConversionFunc > | |
Ctlp::MPConversionIterator< TIN, TOUT, ConversionFunc > | MPConversionIterator implements memory pool for ConversionIterator |
▼Ctlp::StableIterator< tlp::node > | |
Ctlp::SortNodeIterator | This Iterator sorts the nodes in a sequence based on their values in a NumericProperty |
▼Ctlp::StableIterator< tlp::edge > | |
Ctlp::SortEdgeIterator | This Iterator sorts the edges in a sequence based on their values in a NumericProperty |
Ctlp::SortExtremitiesEdgeIterator | This Iterator sorts the edges based on the values of their extremities nodes in a NumericProperty |
Ctlp::SortSourceEdgeIterator | This Iterator sorts the edges based on the values of their source nodes in a NumericProperty |
Ctlp::SortTargetEdgeIterator | This Iterator sorts the edges based on the values of their target nodes in a NumericProperty |
Ctlp::ConcatIterator< T > | This Iterator iterates over the sequence formed by the concatenation of the sequences it is given |
▼Ctlp::StableIterator< T > | Stores the elements of an iterator and iterates a copy |
Ctlp::SortIterator< T, CompareFunction > | Iterator that wraps an existing one and sorts its iterated elements based on comparison function |
Ctlp::StlIterator< T, ITERATOR > | StlIterator wraps a stl iterator |
Ctlp::Iterator< KEY > | |
Ctlp::Iterator< std::pair< KEY, VALUE > > | |
▼Ctlp::Iterator< TYPE > | |
Ctlp::FilterIterator< TYPE, FILTER > | Iterator that enables to filter an other Iterator |
Ctlp::Iterator< TYPEIN > | |
▼Ctlp::Iterator< TYPEOUT > | |
Ctlp::ConversionIterator< TYPEIN, TYPEOUT, ConversionFunc > | Iterator that enables to convert an Iterator of type TYPEIN to an Iterator of type TYPEOUT |
Ctlp::Iterator< unsigned int > | |
▼Ctlp::PropertyInterface::MetaValueCalculator | Base class for computing values on meta nodes and edges |
Ctlp::AbstractProperty< Tnode, Tedge, Tprop >::MetaValueCalculator | This class is used to delegate the computation of the values associated to meta nodes or edges |
Ctlp::node | The node struct represents a node in a Graph object |
Ctlp::PropertyInterface::nodeStringValueRef | Inner class used to overload the operator[] to set a node string value |
Ctlp::AbstractProperty< Tnode, Tedge, Tprop >::nodeValueRef | Inner class used to overload the operator[] to set a node value |
▼Ctlp::Observable | Base of Tulip's observation system |
Ctlp::Camera | Tulip OpenGL camera object |
Ctlp::ColorScale | This class represents a color scale to perform color mapping. The color scale can be either a gradient or defined by colors associated to consecutive intervals. If the color scale is a gradient, returned colors are interpolated in function of a position between 0.0 and 1.0. If the color scale is not a gradient returned colors are computed according to the interval the position belongs to |
Ctlp::GlGraphComposite | Class use to visualize graph in OpenGL Tulip engine |
Ctlp::GlScene | Tulip scene class |
Ctlp::Graph | |
▼Ctlp::PropertyInterface | PropertyInterface describes the interface of a graph property |
►Ctlp::AbstractProperty< nodeType, edgeType, PropertyInterface > | |
►Ctlp::AbstractProperty< tlp::BooleanType, tlp::BooleanType > | |
►Ctlp::AbstractProperty< Tnode, Tedge, Tprop > | This class extends upon PropertyInterface, and adds type-safe methods to get and set the node and edge values, through the magic of template programming |
Ctlp::NumericProperty | Interface all numerical properties. Property values are always returned as double |
►Ctlp::VectorPropertyInterface | VectorPropertyInterface describes the interface of a graph property whose holded value is a vector (std::vector) |
▼Ctlp::View | View plugins provide a way to dynamically add to a Tulip plateform various ways to visualize a graph |
►Ctlp::ViewWidget | ViewWidget provides convenience functions to allow the user to build a view plugin that displays a QWidget as its main element |
Ctlp::ObserverHolder | Convenience class to automatically hold and unhold observers. It performs a call to Observable::holdObservers() at its creation and a call to Observable::unholdObservers() at its destruction. You can use it if you have to hold observers in a function with multiple return points to avoid to call Observable::unholdObservers() for each of them |
Ctlp::OuterPlanarTest | Provides functions to test if a graph is Outer Planar |
Ctlp::PlanarityTest | Performs tests to check whether a graph is planar. From wikipedia: "A planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints." |
▼Ctlp::Plugin | Top-level interface for plug-ins |
▼Ctlp::Algorithm | This abstract class describes a basic algorithm plugin |
Ctlp::PropertyAlgorithm | A non-template interface for tlp::TypedPropertyAlgorithm |
▼Ctlp::Interactor | Interactor provides a way to handle user inputs over a view. Basically, The interactor class is an overlay to the Qt's event filtering mechanism. It adds several features like the ability to define priorities, custom cursors, etc |
►Ctlp::InteractorComposite | |
Ctlp::Perspective | A Perspective is a Tulip plugin that completely re-defines the user interface |
Ctlp::View | View plugins provide a way to dynamically add to a Tulip plateform various ways to visualize a graph |
▼Ctlp::PluginContext | Contains runtime parameters for a plugin |
Ctlp::AlgorithmContext | Parameters structure for a tlp::Algorithm |
Ctlp::PerspectiveContext | A context data structure for tlp::Perspective instances |
Ctlp::PluginLister | Singleton used to list plugins currently loaded into Tulip and retrieve information about them |
▼Ctlp::PluginLoader | A callback class when loading plugins into Tulip |
Ctlp::PluginLoaderTxt | A simple implementation of tlp::PluginLoader to display load state into the console |
Ctlp::PluginProgress | PluginProcess subclasses are meant to notify about the progress state of some process (typically a plugin) |
Ctlp::ProgressPreviewHandler | Handles the way a process handled by a PluginProgress is handled |
Ctlp::QtGlSceneZoomAndPanAnimator | A convenient class to perform a Zoom and Pan animation on a GlMainWidget |
Ctlp::SelectedEntity | Structure to store selected entities |
Ctlp::SelfLoops | Stores all the added information on self loops |
Ctlp::SimpleTest | Performs test to check if a graph is Simple. An undirected graph is simple if it has no loops and no more than one edge between any unordered pair of vertices. A directed graph is simple if has no loops and no more than one edge between any ordered pair of vertices |
CTlpCheckBox | |
Ctlp::TreeTest | Performs test to check whether a graph is a simple or rooted tree. From wikipedia: "A tree is an undirected graph in which any two vertices are connected by exactly one simple path." Free trees have no designated root, while rooted trees do |
Ctlp::TriconnectedTest | Provides functions to test if a graph is triconnected |
CTulip |