Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs
-
Updated
Dec 11, 2020 - C
Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs
This program is a simple version of the make command in linux system.
Creating a dynamic directed multi-graph and performing various operations on it
This is Tideman, a command-line program written in C that emulates a rank-choice voting election on an array of candidates.
A C program that simulates an election using the Tideman (ranked pairs) voting method, identifying the Condorcet winner if one exists. Implements graph-based logic, adjacency matrices, sorting algorithms, and cycle detection to determine the election outcome.
Add a description, image, and links to the cycle-detection topic page so that developers can more easily learn about it.
To associate your repository with the cycle-detection topic, visit your repo's landing page and select "manage topics."