Skip to content

⚡️ Speed up function find_node_with_highest_degree by 2,940% #68

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
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

⚡️ Speed up function find_node_with_highest_degree by 2,940% #68

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
19 changes: 11 additions & 8 deletions src/dsa/nodes.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -93,15 +93,18 @@ def find_node_with_highest_degree(
max_degree = -1
max_degree_node = None

# Precompute in-degree for each node
in_degree = {}
for targets in connections.values():
for tgt in targets:
in_degree[tgt] = in_degree.get(tgt, 0) + 1

for node in nodes:
degree = 0
# Count outgoing connections
degree += len(connections.get(node, []))

# Count incoming connections
for src, targets in connections.items():
if node in targets:
degree += 1
# Outgoing degree (connections from this node)
out_deg = len(connections.get(node, []))
# Incoming degree (connections to this node)
in_deg = in_degree.get(node, 0)
degree = out_deg + in_deg

if degree > max_degree:
max_degree = degree
Expand Down