Package jline.util.graph

Graph theory utilities and algorithms for network analysis.

This package provides graph-theoretic algorithms and data structures for analyzing the topology and connectivity of queueing networks. These utilities support routing analysis, network decomposition, and structural property detection.

• Adjacency matrix representation
• Adjacency list structures
• Weighted and unweighted graphs
• Directed and undirected graph support

• Strongly connected component detection
• Shortest path algorithms (Dijkstra, Floyd-Warshall)
• Topological sorting
• Cycle detection and enumeration
• Minimum spanning tree construction

• Routing matrix analysis
• Network decomposition
• Bottleneck identification
• Critical path analysis
• Flow conservation verification

• Queueing network topology analysis
• Routing probability computation
• Network simplification and aggregation
• Performance bottleneck detection