Gephi.org | Download Gephi | Blog | Gephi Store | Wiki | Forum | Support | Bugtracker

Look for Gephi Plugins

Popular Keywords

Close Search
Marketplace | GPL v3 RSS feed for this section

Image Preview

This is a plugin for Gephi, a graph visualization and manipulation software package. With this plugin, nodes can be given a attribute (column) called ‘image’ that contained a image file name. those images are then loaded from a given path (provided by the Preview Settings). The images appear in the preview window, and can be [...]

More Info
IsometricLayout splits a network into distinct Z-Layers.

IsometricLayout

This layout uses an isometric perspective to visualize networks. I.e. it generates 3D coordinates for all network nodes (x,y,z). Thus, is a method for the visual representation of three-dimensional nodes in two dimensions. It can be used to split a network into distinct Z-Layers (e.g. to better visualize high-performers and/or low-performers, or communities after using [...]

More Info

Edge Betweenness Metric

Edge Betweenness plugin for Gephi. This plugin allows compute Edge Betweenness metric, which can be used in Social Network Analysis. Edge betweenness of an edge as the number of shortest paths between pairs of nodes that run along it.

More Info

GC-Viz

The GC-Viz plugin contains the algorithms GAMer and DB-CSC for the clustering of graphs with node attributes. It also contains a layout for visualizing and comparing the clustering results. The plugin has been developed by Brigitte Boden, Roman Haag and Houran Ketabdar. The plugin is described in the following paper: Brigitte Boden, Roman Haag, and [...]

More Info

Link Communities

This Gephi plug-in implements the Link Communities algorithm proposed in the paper below. Yong-Yeol Ahn, James P. Bagrow & Sune Lehmann, Link communities reveal multiscale complexity in networks, Nature 466, 761–764 (05 August 2010) Paper The algorithm purpose is to reveal communities in undirected and unweigthed networks. It is an agglomerative method (like hierarchical clustering) [...]

More Info

Multipartite Layout

To simplify analyzing connections between groups in multipartite graphs, minimizing edge crossings is a good way to do so. In this work, by using the algorithm suggested in the paper “An Edge Crossing Minimization Algorithm Based on Adjacency Matrix Transformation”, implementation for gephi platform is performed.

More Info

Hiveplot Layout

A Hiveplot Layout implementation for Gephi. For information about hiveplots visit www.hiveplot.com

More Info

Virtuoso Importer

Allows importing of RDF data from a Virtuoso server. Uses the import spigot functionality

More Info

Export to SHP

This Plugin exports two Shapefiles: one for the edges, and one for the nodes. The shapefiles (the respective DBF-Files) contain the columns of the edge and shape tables. It adds the current width/size and color in gephi to two additional columns. The geography is rather simple. The location info is either read from columns in [...]

More Info

Weakly connected components using disjoint set

This is a copy of Gephi internal Connected Components statistics module, only using much faster algorithm to obtain weakly connected components. It was redirected here from a pull request (https://github.com/gephi/gephi/pull/747) due to lack of time for proper testing that would be required to integrate it into the main program.

More Info