![]() |
XII Release 0.1.0
|
Copyright (c) Theophilus Eriata. All Rights Reserved. More...
#include <GraphAlgorithms.h>
Public Member Functions | |
| xiiGraphAlgorithmWorkspace (xiiAllocator *pAllocator=xiiDefaultAllocatorWrapper::GetAllocator()) | |
| Copyright (c) Theophilus Eriata. All Rights Reserved. | |
Friends | |
| class | xiiGraphAlgorithms |
Copyright (c) Theophilus Eriata. All Rights Reserved.
Reusable scratch: O(V) for traversal/path algorithms, O(V + E) for flow/spanning algorithms. Contents are reset before use; no algorithm state is stored in the graph. One workspace per invocation. The allocator must outlive the workspace. Callbacks must not reenter an algorithm using the same workspace.