Large graph support: depending on machine specs, largest graph tested 598a graph (n=110971, m=742009), bigger graphs need longer loading times, with godot’s mesh drawing being the bottleneck
Taking Screenshots: all graphs shown on this site have been generated and captured using the graph visualization program
Edge coloring
Partition coloring: this requires a precalculated partition file, all partitions shown in the gallery have been precalculated using KaHIP
Cluster coloring: this requires a precalculated clustering file, all clusterings shown in the gallery have been precalculated using VieClus
Vertex set coloring: this requires a precalculated vertex set file, all vertex sets shown in the gallery have been precalculated to optimality using a random walk algorithm
Edge length coloring: there are many default options to color the edges based on their length, like viridis, inferno, and plasma, new color maps can be added in an editor
Node degree-based sizing: nodes can be sized according to their degree
Node Scanner
Node scanner: follows the mouse, highlights nodes and outgoing edges, and displays basic information about nodes such as node ID, degree, and, if available, partition ID and vertex set ID
