题目列表
显示 24 / 646 道可提交题。 当前筛选:标签:Graph,难度:中等
Factor Cluster Count: Connected Components on a Thresholded Correlation Graph
Win-Count Leaves on a Forward Scenario Tree
Currency Arbitrage Cycle Detection (Bellman-Ford on Log Rates)
Deepest No-Drawdown Leaf on a Forward Scenario Tree
Factor Dependency Topo Order: Deterministic Min-Heap Kahn for Nightly Rebuild
Fan-Out / Fan-In Coordination — Event Replay
Incremental Largest Cluster Size: Streaming Union-Find on a Factor-Pair Edge Tape
Largest Factor Cluster Size: Maximum Connected Component on a Thresholded Correlation Graph
Min Hops to Core Factor Set: Multi-Source BFS on a Factor-Similarity Graph
Minimum Max-Drawdown Across Root-to-Leaf Paths
Research Pipeline DAG — Cascade-Invalidate Downstream of a Failed Task
Research Pipeline DAG — Compute the Next-Runnable Set
Priority-Driven Task Scheduling with Deps on a Worker Pool
Probability of Reaching a Target Leaf Set on a Binary Scenario Tree
Per-Node Conditional Expected Leaf Payoff on a Scenario Tree
Regime Transition Path Count: Modular DAG Walk Enumeration with Distinguishable Catalysts
Worst-Case Leaf PnL on a Risk-Officer Scenario Tree
Co-Trading Graph — Connected Components of Session Trade Pairs