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.

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

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

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