feat: base dagpool simulation

[chung-thai-nguyen]

No description provided.

[Copilot]

Pull Request Overview

This pull request adds core functionality for simulating dagpool computations, including graph algorithms for Hamiltonian path and cycle detection in tournament graphs.

• Introduces a new module (dagpool/graph.py) with implementations for tournament graph algorithms using Tarjan’s algorithm for strongly connected components.
• Adds a new module (dagpool/schemas.py) that defines several NewType schemas for identifying graph-related entities.

Reviewed Changes

Copilot reviewed 4 out of 4 changed files in this pull request and generated 1 comment.

File	Description
dagpool/graph.py	Adds graph functionality including tournament graph checks, SCCs, Hamiltonian path and cycle finder functions.
dagpool/schemas.py	Provides type definitions used throughout the dagpool module.

Comments suppressed due to low confidence (1)

dagpool/graph.py:168

• [nitpick] The parameter name 'hamiltonian_path' in 'assert_is_strongly_connected_component' is misleading since it actually represents the nodes of a strongly connected component. Consider renaming it to 'scc_nodes' for improved clarity.

def assert_is_strongly_connected_component(self, hamiltonian_path: List[GraphNodeId]):

[Copilot]

The 'print_all_edges' function collects edges in a list but neither prints nor returns the collected list. To match the function name, consider either printing the list or returning it so that its output can be used.