Information system of graph, actors, allocations of actors on the graph, generates an optimal allocation, evaluates its metrics, finds shortest path for an actor from one vertex to another

a "Pokémon Game" which uses a graph and path finding algorithms to traverse and play the game.

Progetto di laboratorio del corso di Algoritmi e Strutture Dati, corso di laurea in Informatica per il Management, Università di Bologna, 2024.

School project aiming to use djiksta algorithm

Group project for data structures and algorithms

A program that helps you find your way on SeoulTech campus.

Some graph implementation I've done

2021-2 이산수학 팀 프로젝트 과제 - 다익스트라 알고리즘 파트

Exercício-Programa da disciplina de AED2 (Análise e Estrutura de Dados) - EACH/USP (Desafio dos "Caminhos mínimos de única origem", implementado com algoritmos de Bellman-Ford e Dijkstra)

Graph Abstract Data Type and Algorithms

Final project of Data Structures and Algorithms.

Data Structures & Algorithms 2 Continuous Assessment 2 - Paris Route Finder

🚗 Solving the rush hour game with dijkstra's algorithm

Visual implementation of Dijkstra's algorithm (academic project)

Graphs (directed/undirected)

Desktop Application work with Constraint Satisfaction Problem (CSP) - Backtracking to solve the scheduling problem at campus and using Dijkstra to search the closest path between room. Case study : Institut Teknologi Del

Old project. A Java program that demonstrates proper node traversal with the Dijkstra's algorithm (no A* upgrade).

Project to design and implement a simulation of an OpenFlow network system with a Controller, multiple clients and an MxN grid of routers. All links between routers are assigned an arbritray time and routing is calculated with the famous Dijkstra Algorithm for the shortest path based on these times. App can be run with java -cp tcdlib.jar:. Main…

The Dijkstra Algorithm finds the shortest path from a source to all destinations in a directed graph (single source shortest path problem). During this process it will also determine a spanning tree for the graph