Add Temporal Condition Shortest Walk

[agitter]

Directed Shortest Walk on Temporal Graphs https://doi.org/10.1101/2022.07.08.499368

https://github.com/YosefLab/temporal_condition_shortest_walk Requires Gurobi

[ctrlaltaf]

• TCSW takes in a series of weighted directed graphs, which each represent time conditions, as inputs. This is a really cool graph algorithm to find the shortest walk, however, perhaps the current version of SPRAS may not support the input format. May want to talk about design decisions regarding this input format in the future if we want to implement TCSW
• The algorithm provides a good example on how to translate graph information (nodes, edges, and weights) and apply the problem to an ILP problem (in this example using Gurobi) which may be useful for future implementations of methods that require ILPs.