In large scale directed graphs, strongly connected components, also known as strongly connected graphs, are a subset of nodes that are traversable from one another. Loops within these subsets are redundant and can result in system inefficiencies and ultimately reduce the performance of a product. This project serves to identify those inefficiencies and remove them from the graphs resulting in a more streamlined product. Starting with a custom graph generator and ending with 3 different algorithms to remove loops, this project creates, identifies, and modifies directed graphs and its strongly connected components.

Team Members

Kevin Kelly
Emma Morris
Diego Niño
Michael Routh
Alysia Sherer