imbajin opened a new pull request, #375:
URL: https://github.com/apache/hugegraph-computer/pull/375

   ## Before → After
   
   Replace stored complete shortest-path lists with unweighted Brandes 
distances, path counts, predecessors and reverse dependency accumulation. 
Process sources in synchronized batches and validate completion before output.
   
   ## Open review and validation boundary
   
   This removes the path-enumeration representation; it does not establish that 
all OOM or performance problems are solved. Current review flags default 
max-step failure, inactive-source scatter overhead and full-graph stack 
allocation, with partition-skew bounds and path-count overflow needing further 
disposition: [🔗 org Computer #28 
review](https://github.com/hugegraph/hugegraph-computer/pull/28#issuecomment-6657977676).
 The PR is submitted for review with these issues unresolved.
   
   The author reports Go 1.23.7 algorithms/worker race tests. No independent 
tests, multi-worker/skewed-partition run or production-scale benchmark were 
performed for this submission.
   
   Source: [🔗 org Computer 
#28](https://github.com/hugegraph/hugegraph-computer/pull/28).
   


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: [email protected]

For queries about this service, please contact Infrastructure at:
[email protected]


---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to