Java Network Analyzer [](https://travis-ci.org/irstv/Java-Network-Analyzer)

Java Network Analyzer provides a collection of graph theory and social network analysis algorithms. These algorithms are implemented on mathematical graphs using the JGraphT library.

Currently supported

Augmented BFS, DFS and Dijkstra algorithms are used to compute:

• Betweenness centrality
• Closeness centrality
• Strahler stream order (for mathematical trees)

Graph types

The underlying graph may be directed, edge-reversed or undirected, and edges may or may not have weights.