A collection of algorithms and data structures

Currency Arbitrage solution with graphs

Algorithms and Data Structures Project

Implementation of Graphs and Greedy Algorithms in C++ and Java

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

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.

A lightweight 2D graph library in Java

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.

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)

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á.

Graph with Adjacency matrix and Incidence Matrix

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

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.

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.

A web tool to build, edit and analyze graphs

Java Implemented Portfolio covering data structures and algorithms including binary trees, red black trees, heap sorting, sorting algorithms, graphs, breath first and depth first search, prim's algorithm, concurrent applications

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

Java program to compute the Minimum Spanning Tree (MST) using Prim's Algorithm. The program reads an adjacency matrix from an input file, calculates the degree of each node, and displays the MST along with its total cost.

Graph classifier that uses adjacency matrices as a base.