matlab solution for missionaries_and_cannibals_problem

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

In this project, we will use the algorithm we learned in the Graph Theory course: Dijkstra's Algorithm. The main purpose of the algorithm is to find the shortest path on Graf.

MSDS 432 - Foundations of Data Engineering

Maze Solver using graph theory made by C++

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

Solving https://adventofcode.com/2022/day/12

The algorithms were written as part of the Algorithms and Data Structures class at UMCS.

Dijkstra's algorithm by Python

2D maze path finding solution using Dijkstra algorithm

Prosty projekt prezentujący działanie algorytmów bfs oraz dijkstra na grafach w kratkę.

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

A Python-based Pac-Man game that uses Dijkstra's and A* algorithms to power intelligent ghost AI pathfinding. Built with Pygame, it features interactive gameplay and customizable grid-based maps.

This project implements an NLP pipeline for unsupervised word clustering on Project Gutenberg texts. The workflow covers corpus cleaning, POS-based vocabulary selection, distance modelling with global and sentence-local metrics, and graph refinement using Dijkstra’s shortest paths, followed by hierarchical clustering and silhouette evaluation.

This repository is devoted to the field of Graph Analysis and related topics.

Graph algorithms and backtracking algorithm

WIP

This repo is created as a part of Data Structure and Algorithms course at my college.