Graphy Algorithms Implemented Within Raphtory

Connected Components

September 27, 2020

Description

A connected component of an undirected graph is a set of vertices all of which are connected by paths to each other. This algorithm calculates the number of connected components in the graph and the size of each, and returns some statisics of these.

Triangle Count and Clustering Coefficient

August 26, 2020

Description

The triangle count algorithm counts the number of triangles (triplet of nodes which all pairwise share a link) that each vertex is a member of, from which additionally the global graph triangle count and clustering coefficient can be realised.