Does anyone now how to modify "def dag_longest_path(G)" in networkx.github.io
to make it relative from a certain vertex I choose? I've been trying to code trace it for quite some time but I can't really seem to understand it, there are some functionalities like G.pred[node] which always come up with an empty set which doesnt make any sense.
bump
post more akarin
Longest path from a certain vertex to what?
...
...
...
...
...
reject the for loop and instead only use the node you supply as a second argument?
...
...
...
...
...
Flip the weights to negative values, then use a shortest path algorithm
...
why are you spamming blank images?
this user asked for them
it's a meme you dip
And you call yourself Yurus? Get out of the club faggot
I'll stay
Just write a recursive one, it would be easy especially in Python
Run dag_longest_path on the descendants of v.