Dynamic DAG (Pearce-Kelly algo)

I looking for a fast implementation of the “Pearce-Kelly” algorithm to solve Dynamic Directed Acyclic Graph (DAG) problems. Graph modification (i.e. node additions and deletions) has to be fast; nodes are simple strings. There are many pure Python implementations, but perhaps there are also compiled binary library interfaces … (I haven’t found one yet … ) I welcome you suggestions! Thank.