maximum flow , Ford_Fulkerson

Question

1.00/5 (2 votes)

See more:

how can I implement alocating person to job useing max-flow & ford_fulkerson ? (i don,t know what is the node and what is the flow in this problem)
problem :
we have :
some jobs with a Specified capacity
number of people that can do some jobs , people can do some job Simultaneously

Posted 6-Jun-13 8:54am

Coder93

Add a Solution

Comments

Christian Graus 6-Jun-13 14:55pm

By writing code. This is obviously homework, so do your own homework, so you learn something.

Coder93 6-Jun-13 15:06pm

it isn't homework !
I know that I can do it with code ,
But my problem is the defenition of node & flowin this question ?

Christian Graus 6-Jun-13 15:11pm

How can it not be homework ? How can you have a question to answer, but it's not school work ? I don't get the question, are node and flow the specifics of the algorithms to use ? If you're asking for direction and not code, we're happy to help, but right now, I'm not sure what you're asking. The flow is surely the allocation of a person to a job ? Wouldn't a node be either a person or a job ?

Coder93 6-Jun-13 15:17pm

i read the max flow algorithm , it use a gragh(some nodes, and edges have the max capacity that can flow on it), but i don't know that in my question what is the node & flow?

Christian Graus 6-Jun-13 15:22pm

Actually, I'm not sure if this is relevant. The max flow problem is, what's the maximum amount of flow you can have in a system. Allocating jobs is something you can do as fast as you like, unless you're constrained by how long the jobs take to do. I don't see any restrictions in the process of allocating jobs that require you to work out how to best work through those restrictions to allocate as fast as possible. Unless there's details you're not telling us.

Coder93 6-Jun-13 15:37pm

oh sorry, i don't say something :
I want to assing jobs to person so that max number of people get jobs.
input of problem :
jobs & their capacity
person & jobs they can do & max number of jobs that can do Simultaneously
out put :
the list of assingments

Christian Graus 6-Jun-13 15:40pm

That really seems simple to me. You give out one job to each person, then you start to allocate a second job to anyone who can take it, then a third to anyone who can take it. That way, the max number of people ( all of them, if possible ) get jobs. In fact, that has to be the most efficient way, too, unless you have data on how fast each person can work.

Coder93 6-Jun-13 15:44pm

i want to implement it according to max flow algorithm & using ford_fulkerson.

Christian Graus 6-Jun-13 15:46pm

I don't think your question makes sense.

Coder93 6-Jun-13 15:51pm

i can't underestand what do you mean !!

Christian Graus 6-Jun-13 15:55pm

Why do you think this algorithm is a fit to solve this problem ?

Coder93 6-Jun-13 15:58pm

we want to assign jobs so that max people involved!

Christian Graus 6-Jun-13 15:59pm

That doesn't mean that this algorithm is a good way to do that. So, why do you think that it is ? What are you doing this for ?

Coder93 6-Jun-13 16:01pm

it is some project that i had read it , i want to do it for myself!
in that project, said that use max flow!

Christian Graus 6-Jun-13 16:07pm

Well, I think you've explained it poorly. If you're trying to teach yourself by looking for tasks to do, I applaud that. Choose tasks you can understand. If you need us to explain the task to you, then you probably need us to show you how to do it. That's not teaching yourself. The task seems pretty random to me, any how, and it seems very probably to me that you need to learn some more core concepts than trying to implement specific algorithms.

Coder93 6-Jun-13 16:13pm

thank's.
so how do you assing? the solution you have said is'nt best assignment.
i have toled all the detail nothing is left.

Christian Graus 6-Jun-13 16:22pm

I'm suggesting you choose a different assignment for yourself.

Coder93 6-Jun-13 16:04pm

in this solution , it isn't the best assignment.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

ridoy · Answer 1 · 2013-06-06T09:05:00

First understand the algorithm and then implement it..
http://weierstrass.is.tokushima-u.ac.jp/ikeda/suuri/maxflow/Maxflow.shtml[^]
http://code.google.com/p/javaplex/source/browse/trunk/src/java/edu/stanford/math/plex4/bottleneck/FordFulkerson.java?spec=svn431&r=431[^]
http://algs4.cs.princeton.edu/64maxflow/FordFulkerson.java.html[^]