A collection of algorithms and data structures

Currency Arbitrage solution with graphs

A new set of lossy and lossless graph compression techniques for external memory representation.

The program provides the products of any cargo company to its customers from the point of departure (dynamically entered by the user). it finds 5 additional shortcuts for the shortest route. The Floyd-Warshall algorithm is used in the solution of the problem.

Data stricture of matrix and linkedList graph and searches in java

A visual interface for creating graphs and their adjacency matrix implemented with Java.

A web tool to build, edit and analyze graphs

Representação de grafos utilizando Matriz de Adjacência e Incidência e Lista

BIS(G²) (Basic Integrated System [Graph * Generator]). Projeto 1/3 da Disciplina de Teoria dos Grafos do curso de bacharelado em Ciência da Computação da URSA - Faculdade RSá.

Here you can find some of mine projects from the bachelor's course of Algorithms and Data Structures, having Luca Tesei as professor at the University of Camerino (UNICAM)

This java swing gui project is a comprehensive scheduling system for a Pediatric Endocrinology Clinic. It uses Directed Graph data structure to efficiently model the complex relationships and constraints between doctors and their shifts. The system ensures that all constraints related to doctor-shift assignments are respected generates timetable.

My data structures course final project

A course scheduler program that schedule courses in different time slot according to conditions. It uses backtracking and dfs.

Graph with Adjacency matrix and Incidence Matrix

Ce projet permet de calculer des chemins entre deux points en utilisant l'Algorithme de Dijkstra

Algorithms and Data Structures Project

This project had me use an adjacency matrix to model a weighted digraph representing the stages of a project. Given input for a graph, this program calculates a project's feasibility, its topological ordering, and the early & late times for the activities(edges) & stages(nodes) of the provided project.

Takes an appropriately formatted txt file, translates an undirected, unweighted graph into an adjacency matrix, and outputs the number of connected components within the graph.

Mangala is a Turkish strategy game played by two players. The game board consists of 12 small pits, 6 for each player, and a large storehouse where each player collects their stones. The game is played with a total of 48 stones.

A lightweight 2D graph library in Java