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
- Vertex Cover size
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 2.0
- Graphical user interface
- Added algorithms
- Improved algorithm efficiency
- Bug fixes
The main window of the GUI
Example histogram of degree distribution
| Program download|
| First steps|
When using a shell, Graphana can be executed by typing the following command:
java -jar graphana.jar
After initialization, the main window appears. Commands can be typed in and executed by pressing Enter or the "Execute" button.
To get a quick help, the keyword HELP can be typed in.
See the manual for detailed usage information.
| Documentation |
- Manual – the complete manual of version 2.0 as PDF
- Operations – List of operations including the most important algorithms
- Extension manual – manual for writing own algorithms in Graphana
- Javadoc – the (partial) documentation of the source code
| License |
Graphana is available under the GNU LGPL and includes the following libraries:
| Contact |
If you have questions, proposals or find bugs, you can contact us by writing an e-mail to:
| Older release|