Closed

Dinic Algorithm (Matlab)

This project was awarded to Atmospheread for €8 EUR.

Get free quotes for a project like this
Employer working
Project Budget
€8 - €30 EUR
Total Bids
4
Project Description

Write a program in matlab, that will solve the problem of maximum flow with usage of Dinic Algorithm in

any graph. The input data will be the number of nodes and links (arcs) between nodes and the cost of

each arc, should be read from a file named ''[url removed, login to view]'' or ''input. xls''. The results of the program

that is the flow and path of each interation, and the maximum flow from Xs to Xt node should be stored

in a file named ''[url removed, login to view]'' or ''[url removed, login to view]'' or must be printed on screen.

Awarded to:

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online