-
Notifications
You must be signed in to change notification settings - Fork 66
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
Directed line graph #178
Directed line graph #178
Conversation
Codecov ReportAttention:
Additional details and impacted files@@ Coverage Diff @@
## main #178 +/- ##
==========================================
+ Coverage 97.97% 97.99% +0.01%
==========================================
Files 28 28
Lines 1828 1891 +63
==========================================
+ Hits 1791 1853 +62
- Misses 37 38 +1
☔ View full report in Codecov by Sentry. |
I would actually do it by simply add a kwarg called |
@shyuep made the changes you suggested, pls have a look when you can |
Thanks |
Summary
Implements constructing a directed line graph, where edges in the original graph have an edge in the line graph if the dst node of the first edge matches the src node of the second. i.e. the following directed edges x = (u,v) and y = (v,w) will have a directed edge in the line graph (x, y).
Implemented:
create_directed_line_graph
ensure_directed_line_graph_compatibility
to be used when a graph and line graph are passed (ie when training)prune_edges_by_features
to prune graphs according to some feature.I had to adapt
compute_theta
to handle the "directed" case, bc in this case one of the bond vectors must be flipped to get the correct angle and not its complement.Checklist
ruff
.mypy
.duecredit
@due.dcite
decorators to reference relevant papers by DOI (example)Tip: Install
pre-commit
hooks to auto-check types and linting before every commit: