-
Notifications
You must be signed in to change notification settings - Fork 7
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.
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
chore!: Update to portgraph 0.13
/ petgraph 0.7
#1878
Conversation
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## main #1878 +/- ##
=======================================
Coverage 86.55% 86.55%
=======================================
Files 195 195
Lines 35569 35584 +15
Branches 32382 32397 +15
=======================================
+ Hits 30786 30801 +15
Misses 3011 3011
Partials 1772 1772
Flags with carried forward coverage won't be shown. Click here to find out more. ☔ View full report in Codecov by Sentry. |
@@ -247,7 +247,7 @@ pub(super) mod test { | |||
Some(Signature::new(vec![usize_t()], vec![usize_t()])) | |||
); | |||
assert_eq!(inner_region.node_count(), 3); | |||
assert_eq!(inner_region.edge_count(), 2); | |||
assert_eq!(inner_region.edge_count(), 1); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This was previously wrong. The inner
subgraph is just a DFG with one input / output connected directly to each other.
21252e1
to
8853214
Compare
The new portgraph release comes with some perf improvements.
We require this update for #1869.
Closes #1872.
I added a benchmark variation for subgraphs with few nodes as a drive-by.
This got improved by the new portgraph (skipping a full graph traversal), but the runtime is still mostly the
O(n)
full-graph traversal required for the convexity checking when building the subgraph.BREAKING CHANGE: Bumped public dependency
portgraph
to breaking version0.13
.