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

Look for Gephi Plugins

Popular Keywords

Close Search

Weakly connected components using disjoint set

Weakly connected components using disjoint set
1 vote, 5.00 avg. rating (90% score)

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.

Similar Plugins

Spanning Tree

Spanning Tree

The plugin finds a minimum spanning tree of a graph using Kruskal’s Algorithm.

More Info

Weighted Cluster Coefficient

This plugin allows to calculate the Weighted Cluster Coefficient for every node and the average value. The weighted clustering capture more precisely the effective level of cohesiveness and affinity due to the interaction strength. Reference: A. Barrat and M. Barthelemy and R. Pastor-Satorras and A. Vespignani (2004). The architecture of complex weighted networks. Proceedings of [...]

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