teg
Finding the best routing to minimize Edge Forwarding Index in a Graph
Summary
| Latest Version | Unknown |
|---|---|
| License | Unknown |
| CI Status | Failing |
| Stars | 1 |
| Forks | 0 |
| Open Issues | 0 |
| Last Commit | 2020-02-04 |
| Downloads | 0 |
| Last Indexed | 2026-08-11 05:08 |
Installation
nimble install teg
choosenim install teg
git clone https://gitlab.com/Kinozuko/teg
OS Compatibility
| Platform | Linux | macOS | Windows | FreeBSD | OpenBSD | NetBSD | Android | iOS | WASM | Embedded |
|---|---|---|---|---|---|---|---|---|---|---|
| teg | ✓ | ✓ | ✓ | - | - | - | - | - | - | - |
Source
| Repository | https://gitlab.com/Kinozuko/teg |
|---|---|
| Homepage | https://gitlab.com/Kinozuko/teg |
| Registry Source | gitlab |
README
Genetic Algorithm to solve edge forwarding index problem in C++
Proposal to obtain B.S Degree in Computer Science
Universidad de Carabobo (UC) Facultad de Ciencias y Tecnologia (Facyt) Departamento de Computacion
Steps to run:
1) make
2) ./main < input_file
input_file can be any graph file with DIMACS format
v1 v2
v1 v3
v2 v3
.. ..
.. ..
vi vj