I recall him saying in a talk, that there is no need to implement his algorithm. In a way the algorithm proves that there are no very hard isomorphism cases, which then guarantees that our other practical heuristic algorithms can't do as badly as we might have feared.