[Simple Java] Maxumum flow of a network flow graph

$10-30 AUD

Closed

Posted

over 4 years ago

$10-30 AUD

Paid on delivery

Hello Freelancers, - The problem is the maximum flow problem of nework flow graph. This problem is to be solved with a library in java(Apache commons math) which I already did. The Graph needs to be converted in the from Ax <= B and used with the tool to get the maximum flow. - Now the problem is generate a random system to be used in the tool, in that case you cannot input the data manually in order to use the tool. The budget is $30 and we have 1-3 days. I would prefer that we finish today. I will give you more info and the code so far in chat. Thank you a lot in advance for your time Best!

Java

Software Architecture

Algorithm

Project ID: 22252513

About the project

3 proposals

Remote project

Active 4 yrs ago

Looking to make some money?

Email address

Benefits of bidding on Freelancer

Set your budget and timeframe

Get paid for your work

Outline your proposal

It's free to sign up and bid on jobs

3 freelancers are bidding on average $23 AUD for this job

@bianyunzhi95

Hello. I have interest in your project. Let's discuss more in chat. Thank you for your kindness Best Regards.

$20 AUD in 7 days

5.0

(85 reviews)

7.3

@alvinpiter

Hello, I am an expert in data structures and algorithm. I've implemented maximum flow algorithm before. Please send the detail via chat, thank you!

$30 AUD in 1 day

5.0

(27 reviews)

4.3

@BellaMenteInc

Hi, Hope you are doing well. Our team members are Competition Expert/Master on International Programming Sites and one of our member is ACM-ICPC Finalist as well. We have in depth understanding of Algorithms and Data Structures. We will deliver your project in 5-6 hours from now. Please feel free to contact us if you need any further information. We look forward to hearing from you. Regards, BellaMenteInc

$18 AUD in 1 day