Uh oh!
There was an error while loading. Please reload this page.
graph construction cleanup - #188
Conversation
yakra
commented
Feb 5, 2019
May have some more commits to add to this. |
We can visit each concurrrent HighwaySegment only once by checking whether it's the first segment in its concurrency list. Doing so removes the need to check a name for each to see if it's been visited, thus removing the need to store the Calling the |
yakra
commented
Feb 10, 2019
Putting this on hold until I get yakra#64 sorted. |
yakra
commented
Feb 10, 2019
This one should be OK. |
jteresco
commented
Feb 10, 2019
I'm holding off on merging in any additional graph generation changes while I'm using the graphs heavily in class. One more week of that then we'll have a break from all that and I'll be a little more adventurous. |
yakra
commented
Feb 10, 2019
Understandable. That graphs are used in your classes is a pretty important reason to make sure any changes are done right, and that things behave in an expected, predictable way. |
self.vertex1&self.vertex2were already defined asgraph.vertices[s.waypoint1.unique_name]&graph.vertices[s.waypoint2.unique_name], making these lookups unnecessary. Saves about 0.4s during graph setup.The
HighwayGraphCollapsedEdgeInfoconstructor is already done this way.