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.

Sign up for GitHub

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

Jump to bottom

Plotting (and shortest paths) of f^+ in the small network example (finite time and periodic) #24

Closed

2 tasks

LuzieH opened this issue Dec 12, 2019 · 1 comment

Labels

Owner

LuzieH commented Dec 12, 2019

todo:

plot f+ on a time-layered network (see image), ie. weighted/directed arrows also go from state in one time layer to state in next time layer
compute shortest paths (or actually paths with max min eff current) from A (in some time layer) to B (in some time layer later)

Owner Author

LuzieH commented Dec 12, 2019

riberaborrell added the enhancement label

LuzieH closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment