bluss
bluss
I can't help but notice that the typst parantheses are flat in the middle while the latex parantheses have smooth curvature along the whole extent.
I think relocatable currently covers this use case: you rename the project folder, like if project1 is now project1.1. I don't think it does more. Without --relocatable, even that breaks...
The main reason is that walking and accessing the graph is much more general, and is intended to cover all use cases. Every borrowing iterator inevitably covers a specific pattern...
The WalkNeighbors struct could of course learn convenience methods that access weights more directly.
Question: Does it have to be an iterator?
To implement a convenience method would be to add a new method next to the ones here https://docs.rs/petgraph/0.4.3/src/petgraph/graph.rs.html#1769-1773
Something that can help you until it's implemented is a function like ```#let neg(space) = h(-space.amount)```. Then you have `$a neg(thin) b$` et.c. available.
I can possibly give feedback on this. Any thoughts about how to give the user back information about how graph indices in the two old graphs map onto the new...
Historical note: GraphRef exists I guess because it unifies `&G where G is an actual graph` with `Reversed`; both are lightweight references to a graph, but the latter is wrapped...
For the record, rye did this https://github.com/astral-sh/rye/pull/233