Advanced MIDI file player

C++ library for finding Strongly Connected Components in parallel, based on paper: https://dl.acm.org/citation.cfm?id=2851161

A clone of the famous Doodle Jump game. Initially created for the SCC (SFML Community Contest) in the German SFML forum

DGraph is a system for directed graph processing with taking advantage of the strongly connected component structure. On this system, most graph partitions are able to reach convergence in order and need to be loaded into the main memory for exactly once, getting much lower data access cost and faster convergence.

CA-GrQc.txt Analyzed Using Directed and Undirected Graphs

C++ implementation of some of the most well-known graph algorithms in the simplest way. Mostly in non-OOP style because the algorithms itself and its performance were the main points.

Amateur concept of articulation points in both undirected and directed graphs

A programming language to make C easier to learn.

STM32F042K6T6 and STM32G031J6M6 based SoundCortex. F042 is driven by register via I2C. G031 is driven by MIDI.

A set of utilities for running calculations on a SLURM powered supercomputer

Proiect Laborator Algoritmi Fundamentali

I have added graph's all part in this file

Study, implementation and comparison of different algorithms for finding the Strongly Connected Components of a directed graph.

Sparse subspace clustering implementation using C++