Skip to content

⚡️ Speed up function find_last_node by 17,056% #188

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
codeflash-ai wants to merge 1 commit into
base: main
Choose a base branch
from
Open

⚡️ Speed up function find_last_node by 17,056% #188

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 6 additions & 1 deletion src/algorithms/graph.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -47,7 +47,12 @@ def find_shortest_path(self, start: str, end: str) -> list[str]:

def find_last_node(nodes, edges):
"""This function receives a flow and returns the last node."""
return next((n for n in nodes if all(e["source"] != n["id"] for e in edges)), None)
# Collect all edge sources into a set for O(1) lookups
edge_sources = {e["source"] for e in edges}
for n in nodes:
if n["id"] not in edge_sources:
return n
return None


def find_leaf_nodes(nodes: list[dict], edges: list[dict]) -> list[dict]:
Expand Down