Package jline.util.graph

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.

Graph Representations

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

Core Algorithms

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

Network Analysis

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

Applications

  • Queueing network topology analysis
  • Routing probability computation
  • Network simplification and aggregation
  • Performance bottleneck detection
Since:
LINE 2.0
See Also: