But if you go through a huge cycle, you might just not connect, and there might be multiple ways to connect, and then you can use this ransack method to try multiple choices. amp gt amp gt Okay.

I gave you the problem of how to solve for known correspondence, which becomes a continuance optimization problem, but there is also a discrete problem here, which is does this lane marker correspond with this guy over here or to that guy over here?