mirror of
https://github.com/alicevision/Meshroom.git
synced 2025-06-01 10:21:59 +02:00
[core][graph] update nodes computability on topology change
CompatibilityNodes introduce a new notion of computability per node. An uncomputed (and therefore uncomputable) CompatibilityNode blocks the computation of all its successor. * update nodes computability on topology change (in addition to min/max depth) * evaluate leaves computability to determine if the whole graph can be processed
This commit is contained in:
parent
89dd55f43b
commit
30cd8001fd
2 changed files with 60 additions and 18 deletions
|
@ -153,9 +153,8 @@ def test_transitive_reduction():
|
|||
]
|
||||
assert set(flowEdgesRes) == set(flowEdges)
|
||||
|
||||
depthPerNode = graph.minMaxDepthPerNode()
|
||||
assert len(depthPerNode) == len(graph.nodes)
|
||||
for node, (minDepth, maxDepth) in depthPerNode.items():
|
||||
assert len(graph._nodesMinMaxDepths) == len(graph.nodes)
|
||||
for node, (minDepth, maxDepth) in graph._nodesMinMaxDepths.items():
|
||||
assert node.depth == maxDepth
|
||||
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue