Bernardo Viggiano's repositories
temporal-graphs
In this practical work, we will explore and implement algorithms for temporal graphs, focusing on analyzing a dynamic system represented by the network of villages and connections in the fictional nation of Baiconia. The goal is to develop a C++ program to determine the shortest distance between villages, the earliest year when all distances can be
planar-graphs
The specific objective of this work is to implement a program in C++ that, given a planar graph and the coordinates of its vertices, is capable of identifying and listing all the faces of the graph. The program must be efficient both in terms of time and space, respecting the execution limits specified in the work statement.
Language:TypeScript000
000
TrabalhoPDS2
Trabalho Prático de Programação e Desenvolvimento de Software
Language:C++000
Language:C++000