bnslmn / steiner-tree-problem

Algorithm for the Steiner Tree Problem

Steiner Tree Problem with/without restrictions

@author Amine Benslimane    
Master 1 STL,
Sorbonne University,
Mai 2021.

GPLv3 Licence, feel free to use this code.

Dans le cadre du projet final de l'UE CPA, Master 1 STL de Sorbonne Université.

Implémentation de deux versions d'Arbres de Steiner : classique et avec restriction budgétaire dans un graphe.

Algorithm

Inspired by : L. Kou, G. Markowsky, and L. Berman, A fast Algorithm for Steiner Trees, IBM Thomas J. Watson Research Center, A fast Algorithm for Steiner Trees

Usage

Cocher "run" dans build.xml --> Ant build configuration --> targets

L'interface graphique SteinerDiskGraphs pops up, enjoy !

Results without restrictions

Results with restrictions

Author

Code

Amine Benslimane, https://github.com/bnslmn

Any suggestions ? ==> [e-mail]

Master STL, Sorbonne Université, Mai 2021.

Interface graphique

M. Binh-Minh Bui Xuan.

Licence

GPLv3, feel free to use this code !