Csaba Kiraly 763ebfe136

set up complete graph if n<=d ...

If the number of nodes in a channel is smaller or equal than the
requested degree, a fully connected graph is used. For n>d, a random
d-regular graph is set up. (For n=d+1, the two are the same.)

Signed-off-by: Csaba Kiraly <csaba.kiraly@gmail.com>

2023-02-23 09:06:57 +01:00

..

__init__.py

Add configuration file, split configuration from simulation shape, fix bug about network degree and unbalanced row/column verification

2023-01-23 18:04:54 +01:00

block.py

Documenting the DAS package for automatic generation with sphinx. First version.

2023-02-15 15:06:42 +01:00

configuration.py

Documenting the DAS package for automatic generation with sphinx. First version.

2023-02-15 15:06:42 +01:00

observer.py

Documenting the DAS package for automatic generation with sphinx. First version.

2023-02-15 15:06:42 +01:00

requirements.txt

Update requirements

2023-01-11 12:50:23 +01:00

results.py

Documenting the DAS package for automatic generation with sphinx. First version.

2023-02-15 15:06:42 +01:00

shape.py

Documenting the DAS package for automatic generation with sphinx. First version.

2023-02-15 15:06:42 +01:00

simulator.py

set up complete graph if n<=d

2023-02-23 09:06:57 +01:00

tools.py

Documenting the DAS package for automatic generation with sphinx. First version.

2023-02-15 15:06:42 +01:00

validator.py

Documenting the DAS package for automatic generation with sphinx. First version.

2023-02-15 15:06:42 +01:00