As graph construction as a high constant factor due to all the vector comparison and heap operations, applications may experience significant speedup if they can re-use graph states between program sessions.
Implementing this cleanly will be quite an undertaking so I'll leave it as an open issue and pursue if there are interested users.
As graph construction as a high constant factor due to all the vector comparison and heap operations, applications may experience significant speedup if they can re-use graph states between program sessions.
Implementing this cleanly will be quite an undertaking so I'll leave it as an open issue and pursue if there are interested users.