Hi,
I am implementing a solution where I match people to places with matching free times and these matches constitute a schedule that will be used (person x will go to place y at free time t). I have an array of free times for each person and place (each person and place is an object) and I want to find a schedule where people are scheduled with a place if they have a matching free time. There are also constraints, such as one person who has a car should be in a group if the place is far (there are attributes for place and person for "isFar" and "hasCar" respectively)
Does anyone have any input on good algorithms of choice I've spent the past few days looking at options (graph algorithms, max flow, constraint graph, ...) but I figure I might as well check with other people that may have an idea.
Thanks, Jeff
Visual C#16
