Skip to content

Extending path matching logic with regular expressions. Leveraging it in CapacityProbe and other places. #51

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

Merged
networmix merged 1 commit into from
Mar 1, 2025
Merged

Extending path matching logic with regular expressions. Leveraging it in CapacityProbe and other places. #51

Show file tree
Hide file tree
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: 5 additions & 2 deletions ngraph/blueprints.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -231,8 +231,11 @@ def _expand_adjacency_pattern(
wrap-around if one side is an integer multiple of the other.
Also skips self-loops.
"""
source_nodes = ctx.network.select_nodes_by_path(source_path)
target_nodes = ctx.network.select_nodes_by_path(target_path)
source_node_groups = ctx.network.select_node_groups_by_path(source_path)
target_node_groups = ctx.network.select_node_groups_by_path(target_path)

source_nodes = [node for _, nodes in source_node_groups.items() for node in nodes]
target_nodes = [node for _, nodes in target_node_groups.items() for node in nodes]

if not source_nodes or not target_nodes:
return
Expand Down
Loading