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.

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.

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

A lightweight 2D graph library in Java

A simple Java application for managing user accounts, connecting friends, and displaying friends lists. It features account creation with password validation and maintains connections using an adjacency matrix.

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.

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

Graphical-Javafx program to calculate and display matrices.

Simple Splitwise App used to minimize the number of transactions among the given set of friends using graph ds and greedy algorithm,

Java implementation of graphs using adjacency matrices. It includes various algorithms for finding shortest paths, detecting cycles, performing pre-order traversals, and calculating the graph's height.

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.

An unsophisticated graph library that supports creating directed or undirected graphs with custom weights. There is the option to choose between an adjacency matrix or list. This application was built for educational purposes.

The program prompts the user to input the number of nodes and edges, followed by the edges in the format of endpoints (u, v). It constructs the adjacency matrix and performs BFS traversal to visit all nodes. Finally, it displays the adjacency matrix and the BFS visit sequence of the graph.

Graph classifier that uses adjacency matrices as a base.

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.