The discretized configuration space of a finite one-dimensional cell complex $G$ can be connected in many ways, few ways, or not at all, depending on $G$. This project begins to take an algorithmic approach to describe sufficient or necessary conditions to determine if a configuration space is connected through primarily graph properties and secondarily algorithmic abilities.

https://docs.google.com/presentation/d/1nhMETr8YxuYO09qCYYYPh1m-axzQSHB82D4r1UlT4I0/edit?usp=sharing