Skip to content

Implementation of the Dijkstra Steiner Algorithm for 3D grid graphs

Notifications You must be signed in to change notification settings

bnw/Chip-Design_Dijkstra-Steiner-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

47 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Summary

Implementation of the Dijkstra Steiner Algorithm. The programm calculates the length of a minimum Steiner Tree for the given instance file.

Compile

cmake . && make task1

Usage

./task1 instance_file

Tests

Requires an installation of the Boost Unit Test Framework that is discoverable by cmake.

cmake . && make tests
./tests

About

Implementation of the Dijkstra Steiner Algorithm for 3D grid graphs

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published