🚀 The feature, motivation and pitch

I’m working on a graph that starts as a DAG with non-negative edges and then adds reversed edges with negative weights, which naturally creates cycles. I’d like a straightforward PyG solution to compute the highest-weight simple directed cycle without reimplementing low-level GNN code.

Any pointers or built-in support for this use case would be greatly appreciated!

Alternatives

No response

Additional context

No response