Implementation: The conjugacy problem in right-angled Artin groups

In 2009, Crisp, Godelle and Wiest constructed a linear-time algorithm to solve the conjugacy problem in right-angled Artin groups. This algorithm has now been implemented in Python, and the code is freely available on GitHub. This document provides a summary of how the code works. As well as determining whether two elements $w_{1}, w_{2}$ are conjugate in a RAAG $A_{\Gamma}$, our code also returns a conjugating element $x \in A_{\Gamma}$ such that $w_{1} = x^{-1}w_{2}x$, if $w_{1}$ and $w_{2}$ are conjugate.