You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
For some graph iterators, e.g. BFS iterator, reallocating all required memory over on each traversal slows down the process when the graph should be traversed multiple times.
Adding an interface function, e.g. go_begin, to reset the iterator to the first position of the graph (container) without releasing allocated memory would speed up the multiple graph traversal.
The text was updated successfully, but these errors were encountered:
For some graph iterators, e.g. BFS iterator, reallocating all required memory over on each traversal slows down the process when the graph should be traversed multiple times.
Adding an interface function, e.g.
go_begin
, to reset the iterator to the first position of the graph (container) without releasing allocated memory would speed up the multiple graph traversal.The text was updated successfully, but these errors were encountered: