In the project we will simulate the transfer of information in a communication network. We will deal with a system where a large number of Threads are active simultaneously accessing resources. The project focuses on synchronizing the threads to avoid races. Locating and repairing the races is the central part of the project.

Algoritmo de Dijkstra e algoritmo Bellman-ford que resolve o problema dos caminhos mínimos (C#)

Package cs-algorithms provides C# implementation of algorithms for data structures and manipulation, as well as graph and string processing