most-queue 1.55__tar.gz → 1.57__tar.gz

{most_queue-1.55 → most_queue-1.57}/.gitignore

@@ -161,3 +161,5 @@ cython_debug/
 #.idea/
 
 .vscode
+
+/works/results/

{most_queue-1.55 → most_queue-1.57}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: most_queue
-Version: 1.55
+Version: 1.57
 Summary: Software package for calculation and simulation of queuing systems
 Project-URL: Homepage, https://github.com/xabarov/most-queue
 Author-email: Xabarov Roman <xabarov1985@gmail.com>
@@ -38,7 +38,7 @@ Requires-Dist: scipy==1.13.0
 Requires-Dist: tqdm
 Description-Content-Type: text/markdown
 
-# Queueing Systems: Simulation & Numerical Methods
+# Queueing Systems: Simulation & Numerical Methods 🔄
 
 ![Queue](assets/queue_long.png)
 
@@ -46,49 +46,46 @@ A Python package for simulating and analyzing queueing systems (QS) and networks
 
 ![GitHub commit activity](https://img.shields.io/github/commit-activity/m/xabarov/most-queue)
 
+---
 
-## About
-This repository focuses on solving steady-state problems in queueing theory.
+### 🔍 Key Features
 
-Key Features:
-- Simulate various types of queueing systems and networks.
-- Numerical methods for solving queueing theory problems.
-- Analyze system performance metrics such as waiting times, soujourn times, load factor and etc.
+- **Simulation**: Model various types of queueing systems and networks.
+- **Numerical Methods**: Solve steady-state problems in queueing theory.
+- **Performance Metrics**: Analyze waiting times, sojourn times, load factors, and more.
 
+---
 
-## Use Cases
-- Modeling cloud computing infrastructure.
-- Designing efficient call centers.
-- Optimizing transportation systems.
-- Network traffic analysis.
+### 📌 Use Cases
 
-## Contributing
-Contributions are welcome! If you find any issues or have suggestions, please open an [issue](https://github.com/xabarov/most-queue/issues). Your pull requests are also appreciated. You can write me at [xabarov1985@gmail.com](mailto:xabarov1985@gmail.com) 
+- **Cloud Computing**: Model infrastructure scalability and performance.
+- **Call Centers**: Optimize staffing and customer wait times.
+- **Transportation**: Improve traffic flow and logistics.
+- **Network Traffic**: Analyze and predict data flow patterns.
 
 ---
 
-## Installation
-- install most-queue with pip
+### 📦 Installation
 ```bash
   pip install most-queue
 ```
+Or install from the repository:
 
-- install most-queue from repository
 ```bash
   pip install -e .
 ```
 
 --- 
 
-## Description of the Project
+## 📚 Project Overview
 
 Most_queue consists of two main parts:
  - **most_queue.theory** contains programs that implement methods for calculating queueing theory models. 
  - **most_queue.sim** contains simulation programs. 
 
-## See examples in the tests folder:
+## 🧪 Example Use Cases
 
-### FIFO QS
+### FIFO Queueing Systems
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
 | 1. | Ek/D/c           |  Numerical calculation of a multi-channel system Ek/D/n   | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_ek_d_n.py) | |
@@ -100,7 +97,7 @@ Most_queue consists of two main parts:
 | 7.  | M/M/c/r         |  Solving for QS M/M/c/r        | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_qs_sim_test.py) | [link](https://github.com/xabarov/most-queue/blob/main/tutorials/queue_sim.ipynb) |
 
 
-### QS with priorities
+### Queueing Systems with Priorities
 
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
@@ -111,21 +108,7 @@ Most_queue consists of two main parts:
 | 5.  | M/G/1/NP           |  Calculating QS with non-preemtive priorities (single-channel).     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_qs_sim_prty.py) |[link](https://github.com/xabarov/most-queue/blob/main/tutorials/priority_queue.ipynb)  |
 | 6.  | M/G/c/Priority           | Calculating QS with NP and PR (multi-channel) by method of relation      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_qs_sim_prty.py) |[link](https://github.com/xabarov/most-queue/blob/main/tutorials/priority_queue.ipynb)  |
 
-
-### Fork-Join QS
-
-| #   | Kendall Notations |  Description      | Example | Tutorial |
-|-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1. | M/M/c/Fork-Join       |  Solving for Fork-Join queueing system      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_fj_im.py) |  |
-| 1. | M/G/c/Split-Join       |  Solving for Split-Join queueing system      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_fj_im.py) |  |
-
-
-### QS with Batch Arrival
-| #   | Kendall Notations |  Description      | Example | Tutorial |
-|-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1.  | M<sup>x</sup>/M/1          |  Solving for the of M<sup>x</sup>/M/1 QS with batch arrival    | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_batch.py) | |
-
-### QS with Vacations
+### Queueing Systems with Vacations
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
 | 1.  | M/H<SUB>2</SUB>/c          |  Numerical calculation of the M/H<SUB>2</SUB>/c system with H<SUB>2</SUB>-warming using the Takahasi-Takagi method.      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_m_h2_h2warm.py) | [link](https://github.com/xabarov/most-queue/blob/main/tutorials/m_h2_h2warm.ipynb)| |
@@ -133,35 +116,56 @@ Most_queue consists of two main parts:
 | 3.  | M/Ph/c         |  Multichannel queuing system with H<SUB>2</SUB>-serving time, H<SUB>2</SUB>-warm-up, H<SUB>2</SUB>-cold delay and H<SUB>2</SUB>-cold (vacations). The system uses complex parameters, which allows you to calculate systems with arbitrary serving, warm-up, cold-delay and cold variation coefficients | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_with_h2_delay_cold_warm.py) | |
 | 4.  | M/M/c          |  Multichannel queuing system with exp serving time, H<SUB>2</SUB>-warm-up and H<SUB>2</SUB>-cold (vacations). The system uses complex parameters, which allows to calculate systems with arbitrary warm-up and cold variation coefficients    | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mmn_h2cold_h2warm.py) | |
 
-### QS with Impatience
+### Queueing Systems with Negative arrivals
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1.  | M/M/1/D         |  Solving for M/M/1 with exponential impatience     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_impatience.py) | |
+| 1.  | M/G/1 RCS         |  Exact calculation of sojourn time for M/G/1 with RCS (remove customer from service) negative arrivals. Service time approximates by H<SUB>2</SUB> or Gamma distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mg1_rcs.py) | |
+| 2.  | M/G/c RCS         |  Numerical calculation of M/G/c with RCS negative arrivals. Service time approximates by H<SUB>2</SUB> distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_rcs.py) | |
+| 3.  | M/G/c disaster         |  Numerical calculation of M/G/c with disaster (remove all customer from service and queue by negative arrival). Service time approximates by H<SUB>2</SUB> distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_disaster.py) | |
+
 
+### Fork-Join Queueing Systems
 
-### QS with Negative arrivals
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1.  | M/G/c RCS         |  Numerical calculation of M/G/c with RCS (remove customer from service) negative arrivals. Service time approximates by H<SUB>2</SUB> distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_rcs.py) | |
-| 2.  | M/G/c disaster         |  Numerical calculation of M/G/c with disaster (remove all customer from service and queue by negative arrival). Service time approximates by H<SUB>2</SUB> distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_disaster.py) | |
+| 1. | M/M/c/Fork-Join       |  Solving for Fork-Join queueing system      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_fj_im.py) |  |
+| 2. | M/G/c/Split-Join       |  Solving for Split-Join queueing system      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_fj_im.py) |  |
 
 
-### Closed QS (with finite number of sources)
+### Others
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1. | M/M/1/N          |  Solving for the Engset model for M/M/1 with a finite number of sources.     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_engset.py) | |
+| 1.  | M<sup>x</sup>/M/1          |  Solving for the of M<sup>x</sup>/M/1 QS with batch arrival    | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_batch.py) | |
+| 2.  | M/M/1/D         |  Solving for M/M/1 with exponential impatience     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_impatience.py) | |
+| 3. | M/M/1/N          |  Solving for the Engset model for M/M/1 with a finite number of sources.     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_engset.py) | |
+| 4.  | General Network |  Numerical calculation of queuing network with priorities in nodes      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_network_im_prty.py) | [link](https://github.com/xabarov/most-queue/blob/main/tutorials/network_with_priorities.ipynb) |
 
-### Queuing Networks
+---
 
-| #   | Kendall Notations |  Description      | Example | Tutorial |
-|-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1.  | General Network |  Numerical calculation of queuing network with priorities in nodes      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_network_im_prty.py) | |
+### 🔍 Search & Indexing Keywords
+- Queueing theory
+- Simulation
+- Numerical methods
+- Queueing networks
+- Performance analysis
+- Cloud computing
+- Call center optimization
+- Transportation systems
+- Network traffic
+- Python package
 
+---
 
-### Usage
+### 📁 Examples & Tutorials
 - Look [here](https://github.com/xabarov/most-queue/tree/main/tests) for examples
 - Look [here](https://github.com/xabarov/most-queue/tree/main/tutorials) for jupyter tutorials
 
+--- 
 
+### 👥 Contributing
 
+Contributions are welcome!
 
+- Open an [issue](https://github.com/xabarov/most-queue/issues) for bugs or suggestions.
+- Submit a pull request for feature enhancements.
+- Contact me at xabarov1985@gmail.com for questions.

{most_queue-1.55 → most_queue-1.57}/README.md

@@ -1,4 +1,4 @@
-# Queueing Systems: Simulation & Numerical Methods
+# Queueing Systems: Simulation & Numerical Methods 🔄
 
 ![Queue](assets/queue_long.png)
 
@@ -6,49 +6,46 @@ A Python package for simulating and analyzing queueing systems (QS) and networks
 
 ![GitHub commit activity](https://img.shields.io/github/commit-activity/m/xabarov/most-queue)
 
+---
 
-## About
-This repository focuses on solving steady-state problems in queueing theory.
+### 🔍 Key Features
 
-Key Features:
-- Simulate various types of queueing systems and networks.
-- Numerical methods for solving queueing theory problems.
-- Analyze system performance metrics such as waiting times, soujourn times, load factor and etc.
+- **Simulation**: Model various types of queueing systems and networks.
+- **Numerical Methods**: Solve steady-state problems in queueing theory.
+- **Performance Metrics**: Analyze waiting times, sojourn times, load factors, and more.
 
+---
 
-## Use Cases
-- Modeling cloud computing infrastructure.
-- Designing efficient call centers.
-- Optimizing transportation systems.
-- Network traffic analysis.
+### 📌 Use Cases
 
-## Contributing
-Contributions are welcome! If you find any issues or have suggestions, please open an [issue](https://github.com/xabarov/most-queue/issues). Your pull requests are also appreciated. You can write me at [xabarov1985@gmail.com](mailto:xabarov1985@gmail.com) 
+- **Cloud Computing**: Model infrastructure scalability and performance.
+- **Call Centers**: Optimize staffing and customer wait times.
+- **Transportation**: Improve traffic flow and logistics.
+- **Network Traffic**: Analyze and predict data flow patterns.
 
 ---
 
-## Installation
-- install most-queue with pip
+### 📦 Installation
 ```bash
   pip install most-queue
 ```
+Or install from the repository:
 
-- install most-queue from repository
 ```bash
   pip install -e .
 ```
 
 --- 
 
-## Description of the Project
+## 📚 Project Overview
 
 Most_queue consists of two main parts:
  - **most_queue.theory** contains programs that implement methods for calculating queueing theory models. 
  - **most_queue.sim** contains simulation programs. 
 
-## See examples in the tests folder:
+## 🧪 Example Use Cases
 
-### FIFO QS
+### FIFO Queueing Systems
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
 | 1. | Ek/D/c           |  Numerical calculation of a multi-channel system Ek/D/n   | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_ek_d_n.py) | |
@@ -60,7 +57,7 @@ Most_queue consists of two main parts:
 | 7.  | M/M/c/r         |  Solving for QS M/M/c/r        | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_qs_sim_test.py) | [link](https://github.com/xabarov/most-queue/blob/main/tutorials/queue_sim.ipynb) |
 
 
-### QS with priorities
+### Queueing Systems with Priorities
 
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
@@ -71,21 +68,7 @@ Most_queue consists of two main parts:
 | 5.  | M/G/1/NP           |  Calculating QS with non-preemtive priorities (single-channel).     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_qs_sim_prty.py) |[link](https://github.com/xabarov/most-queue/blob/main/tutorials/priority_queue.ipynb)  |
 | 6.  | M/G/c/Priority           | Calculating QS with NP and PR (multi-channel) by method of relation      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_qs_sim_prty.py) |[link](https://github.com/xabarov/most-queue/blob/main/tutorials/priority_queue.ipynb)  |
 
-
-### Fork-Join QS
-
-| #   | Kendall Notations |  Description      | Example | Tutorial |
-|-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1. | M/M/c/Fork-Join       |  Solving for Fork-Join queueing system      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_fj_im.py) |  |
-| 1. | M/G/c/Split-Join       |  Solving for Split-Join queueing system      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_fj_im.py) |  |
-
-
-### QS with Batch Arrival
-| #   | Kendall Notations |  Description      | Example | Tutorial |
-|-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1.  | M<sup>x</sup>/M/1          |  Solving for the of M<sup>x</sup>/M/1 QS with batch arrival    | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_batch.py) | |
-
-### QS with Vacations
+### Queueing Systems with Vacations
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
 | 1.  | M/H<SUB>2</SUB>/c          |  Numerical calculation of the M/H<SUB>2</SUB>/c system with H<SUB>2</SUB>-warming using the Takahasi-Takagi method.      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_m_h2_h2warm.py) | [link](https://github.com/xabarov/most-queue/blob/main/tutorials/m_h2_h2warm.ipynb)| |
@@ -93,35 +76,56 @@ Most_queue consists of two main parts:
 | 3.  | M/Ph/c         |  Multichannel queuing system with H<SUB>2</SUB>-serving time, H<SUB>2</SUB>-warm-up, H<SUB>2</SUB>-cold delay and H<SUB>2</SUB>-cold (vacations). The system uses complex parameters, which allows you to calculate systems with arbitrary serving, warm-up, cold-delay and cold variation coefficients | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_with_h2_delay_cold_warm.py) | |
 | 4.  | M/M/c          |  Multichannel queuing system with exp serving time, H<SUB>2</SUB>-warm-up and H<SUB>2</SUB>-cold (vacations). The system uses complex parameters, which allows to calculate systems with arbitrary warm-up and cold variation coefficients    | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mmn_h2cold_h2warm.py) | |
 
-### QS with Impatience
+### Queueing Systems with Negative arrivals
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1.  | M/M/1/D         |  Solving for M/M/1 with exponential impatience     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_impatience.py) | |
+| 1.  | M/G/1 RCS         |  Exact calculation of sojourn time for M/G/1 with RCS (remove customer from service) negative arrivals. Service time approximates by H<SUB>2</SUB> or Gamma distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mg1_rcs.py) | |
+| 2.  | M/G/c RCS         |  Numerical calculation of M/G/c with RCS negative arrivals. Service time approximates by H<SUB>2</SUB> distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_rcs.py) | |
+| 3.  | M/G/c disaster         |  Numerical calculation of M/G/c with disaster (remove all customer from service and queue by negative arrival). Service time approximates by H<SUB>2</SUB> distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_disaster.py) | |
+
 
+### Fork-Join Queueing Systems
 
-### QS with Negative arrivals
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1.  | M/G/c RCS         |  Numerical calculation of M/G/c with RCS (remove customer from service) negative arrivals. Service time approximates by H<SUB>2</SUB> distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_rcs.py) | |
-| 2.  | M/G/c disaster         |  Numerical calculation of M/G/c with disaster (remove all customer from service and queue by negative arrival). Service time approximates by H<SUB>2</SUB> distribution     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_mgn_disaster.py) | |
+| 1. | M/M/c/Fork-Join       |  Solving for Fork-Join queueing system      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_fj_im.py) |  |
+| 2. | M/G/c/Split-Join       |  Solving for Split-Join queueing system      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_fj_im.py) |  |
 
 
-### Closed QS (with finite number of sources)
+### Others
 | #   | Kendall Notations |  Description      | Example | Tutorial |
 |-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1. | M/M/1/N          |  Solving for the Engset model for M/M/1 with a finite number of sources.     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_engset.py) | |
+| 1.  | M<sup>x</sup>/M/1          |  Solving for the of M<sup>x</sup>/M/1 QS with batch arrival    | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_batch.py) | |
+| 2.  | M/M/1/D         |  Solving for M/M/1 with exponential impatience     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_impatience.py) | |
+| 3. | M/M/1/N          |  Solving for the Engset model for M/M/1 with a finite number of sources.     | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_engset.py) | |
+| 4.  | General Network |  Numerical calculation of queuing network with priorities in nodes      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_network_im_prty.py) | [link](https://github.com/xabarov/most-queue/blob/main/tutorials/network_with_priorities.ipynb) |
 
-### Queuing Networks
+---
 
-| #   | Kendall Notations |  Description      | Example | Tutorial |
-|-----|-------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-------------------|-------------------|
-| 1.  | General Network |  Numerical calculation of queuing network with priorities in nodes      | [link](https://github.com/xabarov/most-queue/blob/main/tests/test_network_im_prty.py) | |
+### 🔍 Search & Indexing Keywords
+- Queueing theory
+- Simulation
+- Numerical methods
+- Queueing networks
+- Performance analysis
+- Cloud computing
+- Call center optimization
+- Transportation systems
+- Network traffic
+- Python package
 
+---
 
-### Usage
+### 📁 Examples & Tutorials
 - Look [here](https://github.com/xabarov/most-queue/tree/main/tests) for examples
 - Look [here](https://github.com/xabarov/most-queue/tree/main/tutorials) for jupyter tutorials
 
+--- 
 
+### 👥 Contributing
 
+Contributions are welcome!
 
+- Open an [issue](https://github.com/xabarov/most-queue/issues) for bugs or suggestions.
+- Submit a pull request for feature enhancements.
+- Contact me at xabarov1985@gmail.com for questions.

most_queue-1.57/most_queue/general/plots.py

@@ -0,0 +1,69 @@
+"""
+Plotting utilities for simulation results.
+"""
+from enum import Enum
+
+import matplotlib.pyplot as plt
+
+
+class DependsType(Enum):
+    """
+    Enum to specify the type of dependency for plotting.
+    """
+    NONE = 0
+    UTILIZATION_FACTOR = 1
+    CHANNELS_NUMBER = 2
+    COEFFICIENT_OF_VARIATION = 3
+
+
+def plot_sim_vs_calc_moments(xs: list[float], sim_results: list[float],
+                             calc_results: list[float],
+                             depends_on: DependsType = DependsType.CHANNELS_NUMBER,
+                             is_errors=False, is_waiting_time=True, save_path=None):
+    """
+    Plots the simulation and calculated moments for a given list of x values.
+    :param xs: A list of x values (e.g., utilization factors or number of channels).
+    :type xs: list[float]
+    :param sim_results: A list of simulated results.
+    :type sim_results: list[float]
+    :param calc_results: A list of calculated results using some analytical or numerical method.
+    :param depends_on: The type of dependency for plotting (utilization factor, number of channels, etc.).
+    :type depends_on: DependsType
+    :param is_errors: If True, plots the percentage error between simulation and calculation results.
+    :type is_errors: bool
+    :param is_waiting_time: If True, labels the y-axis as waiting time; otherwise, as sojourn time.
+    :type is_waiting_time: bool
+    :param save_path: The path where the plot should be saved. If None, the plot will not be saved.
+    :type save_path: str or NoneType
+    :return: None
+    """
+    _fig, ax = plt.subplots()
+    if is_errors:
+        errors = [100 * (w_sim - w_tt) / w_tt for w_sim,
+                  w_tt in zip(sim_results, calc_results)]
+
+        ax.plot(xs, errors)
+        ax.set_ylabel(r"$\varepsilon$, %")
+    else:
+        ax.plot(xs, sim_results, label="Sim")
+        ax.plot(xs, calc_results, label="Calc")
+        if is_waiting_time:
+            ax.set_ylabel(r"$\omega_{1}$")
+        else:
+            ax.set_ylabel(r"$\upsilon_{1}$")
+        plt.legend()
+
+    if depends_on == DependsType.UTILIZATION_FACTOR:
+        ax.set_xlabel(r"$\rho$")
+    elif depends_on == DependsType.COEFFICIENT_OF_VARIATION:
+        ax.set_xlabel(r"$\nu$")
+    else:
+        ax.set_xlabel("n")
+        plt.xticks(range(1, len(xs) + 1))
+
+    if save_path is not None:
+        plt.savefig(save_path, dpi=300)
+    else:
+        plt.show()
+
+    plt.close(_fig)