Most efficient time and space complexity for sharing meals
Budget: $10 – $30 AUD
Hi there,
Please find the specifications attached below.
my Idea: We can use min cost maximal bipartite, fold Fulkerson algorithm, creating 0.33 nodes for each person with edge weight 0 to respective breakfast and dinner days where a person is willing to prepare it and 0.11 nodes for each person with edge weight 1 to respective breakfast and dinner days where a person is willing to prepare and find matching. All unmatched dinners or breakfasts will be ordered from restro.
Please find an example of how it should work as well below. Please note I would like a bit of documentation about the approach taken.
NOTE: Do not use sets or dictionaries.
Any other idea is invited. Please comment that you have successfully did this.
Please find the specifications attached below.
my Idea: We can use min cost maximal bipartite, fold Fulkerson algorithm, creating 0.33 nodes for each person with edge weight 0 to respective breakfast and dinner days where a person is willing to prepare it and 0.11 nodes for each person with edge weight 1 to respective breakfast and dinner days where a person is willing to prepare and find matching. All unmatched dinners or breakfasts will be ordered from restro.
Please find an example of how it should work as well below. Please note I would like a bit of documentation about the approach taken.
NOTE: Do not use sets or dictionaries.
Any other idea is invited. Please comment that you have successfully did this.