This content has been marked as final. Show 4 replies
Your "business relationship" as an excuse won't fool us. But your adult service is a variation of matchmaking problems :o)
Indeed in the previous sentence the word match-making was not meant to be ironic; that's how I've seen this kind of problems classified, but I can't seem to find a reference for such classification. One example of such algorithm is [Ford-Fulkerson|http://en.wikipedia.org/wiki/Ford_Fulkerson]. It implies you are able to assign weights to edges between two nodes (e.g., assign infinity when a company blacklists another one, and between fixed-schedule companies that cannot meet each-other).
Hehe I know it can seem that the word "match-making" could be classified as an adult dateservice but its really is a
method for making companies to meet new companies, but its is organized precisly as a common speeddate service.
Can you tell me a little more about the Ford-Fulkerson and how it can be implemented? :o)
I'll probally solved it by using a prioritytable that is generated by how many times a moving company is
in a fixed company.
After the prioritytable is set, de scheduletable is set by go though the prioritytable and se what value
is fit for what place.
Kind of hard to explain without a picture.
But thanks for the reply but weighted nodes got somewhat complicated in the code, maybe a good solution
but I don't have any experience in that area.
it really is a method for making companies to meet new companiesI take your word for it, I was just densely kidding.
how many times a moving company is in a fixed company.You're sure this is not disguised language for an adult service, again?!? :ob
Can you tell me a little more about the Ford-Fulkerson and how it can be implemented? :o)I provided a link in my first reply. But maybe it's overkill; I'm glad you solve it otherwise. I hope your suggested solution will get reviewed by more educated algorithmics fans here.
Good luck with your "business service".