Welcome to Talipot Python documentation!¶
Talipot is an information visualization framework written in C++ dedicated to the analysis and visualization of graphs. Talipot Python is a set of modules that exposes to Python almost all the content of the Talipot C++ API. The bindings has been developed with the SIP tool. The main features provided by the bindings are listed below :
creation and manipulation of graphs
storage of data on graph elements (float, integer, boolean, color, size, coordinate, list, …)
application of algorithms of different types on graphs (layout, metric, clustering, …)
the ability to write Talipot plugins in pure Python
The bindings can be used inside the Talipot software GUI in order to run scripts on the current visualized graph. The bindings can also be used outside Talipot through the classical Python interpreter.
Contents¶
- Getting started
- Release notes and API changes
- Manual
- Writing Talipot plugins in Python
- Writing a general algorithm in Python
- Writing a selection algorithm in Python
- Writing a color algorithm in Python
- Writing a measure algorithm in Python
- Writing an integer algorithm in Python
- Writing a layout algorithm in Python
- Writing a size algorithm in Python
- Writing an export module in Python
- Writing an import module in Python
- Talipot plugins documentation
- Algorithm
- Acyclic
- Biconnected
- Connected
- Curve edges
- Delaunay triangulation
- Directed Tree
- Edge bundling
- Equal Value
- Free Tree
- Graph
- Hierarchical
- Make Acyclic
- Make Biconnected
- Make Connected
- Make Directed Tree
- Make Planar Embedding
- Make Simple
- Maximal Cliques Enumeration
- Outer Planar
- Planar
- Planar Embedding
- Quotient Clustering
- Reverse edges
- Simple
- Triconnected
- Voronoi diagram
- Coloring
- Export
- Import
- Adjacency Matrix
- Attract And Introduce Model
- BibTeX
- Bollobas et al. Model
- Bu Wang Zhou Model
- Catanzaro and al. Model
- Circulant Graph (OGDF)
- Complete General Graph
- Complete K-partite Graph (OGDF)
- Complete Tree
- Empty graph
- Erdős-Rényi Random Graph
- File System Directory
- Fu and Liao Model
- GEXF
- GML
- Git
- Globe Graph (OGDF)
- Graphviz
- Grid
- Grid Approximation
- Guillaume Latapy Model
- Holme and Kim Model
- JSON Import
- Klemm Eguiluz Model
- Liu et al. model
- Pajek
- Petersen Graph (OGDF)
- Planar Graph
- Random Chung Lu Graph (OGDF)
- Random General Graph
- Random General Tree
- Random Geographical Graph (OGDF)
- Random Graph (OGDF)
- Random Hierarchy (OGDF)
- Random Planar Biconnected Graph (OGDF)
- Random Planar Connected Graph (OGDF)
- Random Regular Graph (OGDF)
- Random Simple Graph
- Random Simple Graph (OGDF)
- Random Simple Graph By Probability (OGDF)
- Regular Lattice Graph (OGDF)
- Regular Tree (OGDF)
- TLP Import
- TLPB Import
- UCINET
- Uniform Random Binary Tree
- Wang and Rong Model
- Wang et al. Model
- Watts Strogatz Model
- Labeling
- Layout
- 3-Connected (Tutte)
- Balloon (OGDF)
- Bertault (OGDF)
- Bubble Pack
- Bubble Tree
- Circular
- Circular (OGDF)
- Cone Tree
- Connected Components Packing
- Connected Components Packing (Polyomino)
- DTreeMultilevelEmbedder (OGDF)
- Dendrogram
- Dominance (OGDF)
- FM^3 (OGDF)
- Fast Multipole Embedder (OGDF)
- Fast Multipole Multilevel Embedder (OGDF)
- Fast Overlap Removal
- Frutcherman Reingold (OGDF)
- GEM (Frick)
- GEM Frick (OGDF)
- GRIP
- Hierarchical Graph
- Hierarchical Tree (R-T Extended)
- Improved Walker
- Improved Walker (OGDF)
- Kamada Kawai (OGDF)
- LinLog
- Mixed Model
- OrthoTree
- Perfect aspect ratio
- Pivot MDS (OGDF)
- Planarization Grid (OGDF)
- Planarization Layout (OGDF)
- Radial Tree (OGDF)
- Random layout
- Squarified Tree Map
- Stress Minimization (OGDF)
- Sugiyama (OGDF)
- Tile To Rows Packing (OGDF)
- Tree Leaf
- Tree Radial
- Upward Planarization (OGDF)
- Visibility (OGDF)
- circo (Graphviz)
- dot (Graphviz)
- fdp (Graphviz)
- neato (Graphviz)
- sfdp (Graphviz)
- twopi (Graphviz)
- Measure
- Betweenness Centrality
- Biconnected Components
- Cluster
- Connected Components
- Convolution
- Dag Level
- Degree
- Depth
- Eccentricity
- Id
- K-Cores
- Leaf
- Link Communities
- Louvain
- MCL Clustering
- Node
- Page Rank
- Path Length
- Random metric
- Strahler
- Strength
- Strength Clustering
- Strongly Connected Components
- Welsh & Powell
- Resizing
- Selection
- Algorithm
talipotmodule API- Utility functions
- Graph elements classes
- The tlp.Graph class
- Talipot datatypes
- Talipot observation mechanism
- Graph properties classes
- tlp.PropertyInterface
- tlp.BooleanProperty
- tlp.ColorProperty
- tlp.NumericProperty
- tlp.DoubleProperty
- tlp.IntegerProperty
- tlp.LayoutProperty
- tlp.SizeProperty
- tlp.StringProperty
- tlp.BooleanVectorProperty
- tlp.CoordVectorProperty
- tlp.ColorVectorProperty
- tlp.DoubleVectorProperty
- tlp.IntegerVectorProperty
- tlp.SizeVectorProperty
- tlp.StringVectorProperty
- Talipot plugins classes
- Graph test classes
talipotpluginsmodule API