Summary of Changes

Hello @waruqi, I'm Gemini Code Assist¹! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed!

This pull request focuses on improving the efficiency and robustness of the core graph data structure and its application in the jobgraph module. The changes optimize fundamental graph operations like checking for vertex and edge existence, and ensure that edges are added without duplication. This leads to a cleaner and potentially more performant implementation for managing task dependencies within the jobgraph.

Highlights

• Graph Performance Optimization: The has_vertex and has_edge methods in the core graph module have been optimized for faster lookups, transitioning from potentially linear scans to direct hash table access.
• Duplicate Edge Prevention: The add_edge method in the graph module now explicitly checks for and prevents the addition of duplicate edges, ensuring graph integrity.
• Simplified Jobgraph Logic: The add_orders method within the async/jobgraph module has been streamlined by removing redundant has_edge checks, as the underlying graph:add_edge method now handles duplicate edge prevention.