Skip to content

🚀 Shortest-Paths implementation of Bellman-Ford algorithm in Kotlin

License

Notifications You must be signed in to change notification settings

lucastanger/Spanning-Tree-Simulation

Repository files navigation

Spanning-Tree-Simulation

Build Status License GitHub code size in bytes GitHub issues GitHub release (latest by date including pre-releases) Codacy Badge Coverage Status

Study project for the lecture laboratory network engineering in the 4th semester.

Prerequisites

To run the project, you need to have Kotlin v1.3 installed.

Kotlin

SDKMAN!

An easier way to install Kotlin on UNIX based systems such as OS X, Linux, Cygwin, FreeBSD and Solaris is by using SDKMAN!. Simply run the following in a terminal and follow any instructions:

$ curl -s https://get.sdkman.io | bash

Next open a terminal and install Kotlin with:

$ sdk install kotlin

Homebrew

Alternatively, on OS X you can install the compiler via Homebrew.

$ brew update
$ brew install kotlin

Gradle

To have all external project packages installed, use the following gradle steps:

$ gradle jar

Start the jar located in build/libs

$ java -jar Spanning-Tree-Simulation.jar

Built With

  • Kotlin - Development Language
  • Gradle - Dependency & Build Management

Versioning

The project uses SemVer for versioning. For the versions available, see the tags on this repository.

Authors

License

This project is licensed under the Apache License 2.0 - see the LICENSE.MD file for details