OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.

An algorithm to look for maximum "edge" biclique

A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as which states the graph sta…

MST-ReplacementEdges: Find Minimum Spanning Tree Replacement Edges

COE428 - Engineering Algorithms & Data Structures deals with the fundamental means to approach the design and analysis of algorithms in an effective and methodologically correct manner in C programming language. This course is taken at TMU, formally known as Ryerson.

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

Repo for Assignment 2 of Parallel Computation Course 2017-18 2nd Semester BITS Pilani, Pilani Campus

Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs