What
Current in the DependencyGraph we use a std::vector and return the index of the graph, the user then has to track that.
This means we are also need to keep track in a separate place. So just using a map is probably the better option.
TODO:
- GraphIndex type: Change from std::size_t to IdentifierHash
- dep graph:
- Change
std::vector<GraphNode> nodes to std::unordered_map<IdentifierHash, GraphNode> nodes
- should we just track
capacity_ or remove?
- Change visited (not sure what is best there).
RunTarget and ProcessInfoNode take an index, this shall be removed and the map shall track this now.
traverse() Not sure what is the best there, keep the map iterator
Acceptance Criteria (DoD)
DependencyGraph uses IdentifierHash as the key
How
No response
What
Current in the
DependencyGraphwe use a std::vector and return the index of the graph, the user then has to track that.This means we are also need to keep track in a separate place. So just using a map is probably the better option.
TODO:
std::vector<GraphNode> nodestostd::unordered_map<IdentifierHash, GraphNode> nodescapacity_or remove?RunTargetandProcessInfoNodetake an index, this shall be removed and the map shall track this now.traverse()Not sure what is the best there, keep the map iteratorAcceptance Criteria (DoD)
DependencyGraphusesIdentifierHashas the keyHow
No response