Energy Delivery - Entry for Ludum Dare 53 (game compo)

small implementation of graph theory algorithms in C

A powerful and flexible C (ANSI 89) library for creating graphs, a mathematical tool with almost endless applications

lem_in is a project focused on data structures and graph traversal algoritms.

Graph theory, maximum flow at minimum cost

2025 2nd Semester Informatics Data Structure Assignments and Practical

The "Philosophers" project at 42 is a programming exercise based on Edsger Dijkstra's dining philosophers problem. Students simulate philosophers alternating between thinking and eating, sharing forks, and managing concurrent resource access to avoid deadlocks and ensure proper synchronization.

Optimise cellular tower networks with modified MST algorithms (Kruskal's & Prim's). Includes real-world constraint handling, visualization tools, and support for diverse network configurations.

Multi-language project (Java/C) for IMDb actor collaboration analysis. Builds an undirected graph and calculates shortest paths concurrently using BFS and multithreading.

Assignments and problems from coursera course of Algorithms ,Princeton University

Graph Theory - Trees

Signed graph balance checking algorithms, B.Sc. thesis, TEI of Crete, 2014

A program to compute the nesting index of double occurrence words

PgIRoute forked from pgrouting v1.4

Compute a Eulerian trail (Eulerian path) through a graph iff one exists

Lem-in

This repository contemplates the studies of popular graph algorithms and their properties applied to contextual problems and practical applications.

This is Push Swap, a 42 project about sorting a stack with limited movements... but i choose to solve it with a stochastic perspective.