Hello,
I’m stuck in finding a way to have the max number of contiguous segments, the goal is to find the longest road (max length will be about 15 roads).
There is only bifurcations (single fork for a road).
Each segment is a BP with a box collision that overlap the others, so I have paired my roads and stored pairs in an array (a struct of 2 actors).
What I’d like to do, is chaining the pairs and get the longest chain, but I can’t find the logic!
- Store it in a new dynamically array? how to creat multiple temporary array?
- Using map (dictionnary) variable (I haven’t well understood mapping, is it usefull in my case?) ?
Thanks for your help!
