You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
ThyW 31357dd320 Added correct readme 8 months ago
include bunch of stuff 8 months ago
src bunch of stuff 8 months ago
.dir-locals.el Setup functional project 9 months ago
.envrc Basic Nix env 9 months ago
.gitignore added some inimportant stuff 8 months ago
README.md Added correct readme 8 months ago
flake.lock Basic Nix env 9 months ago
flake.nix sfml now links, added sfml.dev dependency to flake 8 months ago
meson.build Types 8 months ago
run.sh Added graphics header and implementation. 8 months ago

README.md

About

This is supposed to be a fully working simulation and implementation of the OSPF network algorithm for finding the best(fastest) route for packets, depending on the speed between of the connections between routers.

How it works

We have two threads. Main thread is responsible for rendering and passing information to the second, simulation thread. On the simulation thread, the network simulation runs. For that we use the Network class which is responsible for passing around messages. Messages are an instance of Message class. A network has a list of routers, objects of the Router class which have they unique RouterId which is basically an IP v.4 address. Updates, such as a new routers and requests for fastest paths are passed into the Network by a NetworkHandle, which has access to the Network thread and is able to send it information. This information is passed by so called Events which are instances of the Event class. Events can be passed both ways, in order to communicate actions which should be rendered on the main thread.

Requirements

  • SFML 2.4
  • clang 13.0