You will develop an algorithm for a real estate agent. Agent has n apartments to hire and m
customers. After visiting the apartments, customers provide a list of apartments that they are
willing to hire. They may hire any apartment in their list but they refuse to hire the apartments
that are not in their list. There is no priority among the apartments in their list. One apartment can be hired only by one customer.
Agent wishes to find a matching between customers and apartments such that maximum number of apartments are hired. In this project, you will suggest and implement an algorithm
which finds this matching.
Hint: First you need to model the problem as a graph, then modify this graph in a way that an
algorithm in your lecture slides can be applied to solve it
Hi there,
I've already read and understood the project description. I used to implement the algorithm to find the maximum matching in a bipartite graph (which can be used for this case) so I'm sure I can complete this task for you. Hope to have chance to work with you, thanks for your consideration!
Regards.
$30 USD in 0 day
5.0 (21 reviews)
4.3
4.3
9 freelancers are bidding on average $35 USD for this job
Hi, Friend.
We are the freelancer group that have enough experience in C/C++ programming.
We think we can help you perfectly & asap.
Please tell us your details.
Thanks.
basically the agent must assign the apartments to the users following the next rules:
while (demand =0)
arrange the apartments from minimum to maximum demand of users
assign the apartment with minimun demand of persons to the person with the minimun number of apartment options.
Hi,
I saw your job post and I am very interested in it. I am part of an experienced team of software developers, we can assure a quality final product and precise delivery dates.
Regards,
Javier Flores
I have been writing C++ programs for more than 20 years and can have this project completed within 3 days of your acceptance of my bid.
This looks like an interesting problem. I would suggest creating a structure which would allow the program to determine whethet there are any apartments with a single potential customer or any customers with a single apartment. After assigning these and removing the associated apartments and customers from the pool, reiterate the search until all apartments are assigned or all customers are placed.