Graphana can be used to analyze the combinatorial structure of graphs. Given one or more input graph(s), Graphana computes or estimates the values and distributions of different graph parameters.
Example parameters include:
Maximum degree
Diameter
Vertex Cover size
Degeneracy
Treewidth
h-index
...
Other things, that can be done with Graphana:
Graph instance creation (e.g. with random generators)
Graph visualization
Algorithm visualization (step-by-step)
Algorithm time measurement
...
The current version of Graphana is 3.0.
Improvements from version 2.0:
Improved graph loading interface and code, support METIS graph format
Added algorithms
Improved algorithm efficiency
Bug fixes
Screenshots
The main window of the GUI
Graph visualization
Example histogram of degree distribution
Time measurements
Program download
Executable .jar file – the full Graphana program for analyzing graphs via basic commands