IITDU Forum
Would you like to react to this message? Create an account in a few clicks or log in to continue.

IITDU Chat Box

Maximum network flow algorithm: an implementation in C

IITDU Forum :: Academics (BIT) :: Semester 3 :: CSE 301

Go down

Maximum network flow algorithm: an implementation in C Empty Maximum network flow algorithm: an implementation in C

Post by BIT0220-Iftekhar Fri May 06, 2011 3:58 pm

Course name: Combinatorial Optimization
Course code: CSE-301
Date: 06-05-'11
File size: around 4 KB

Hi guys,
We went through the Maximum network flow algorithm in this course. And we had to find the maximum flow in a network which will be optimized.
So here is a little implementation of that which I tried in C. The flow counted here is for all network paths and I used DFS algorithm to do so with the help of a simple stack. Wink

The .zip file contains a single folder. Inside it you'll find 8 input files for different network graphs, a header file and a C file. Just change the file name in the code to see the result for different graphs.

So [You must be registered and logged in to see this link.] is the code.


Last edited by BIT0220-Iftekhar on Fri May 06, 2011 3:59 pm; edited 1 time in total (Reason for editing : Topic title changed)
BIT0220-Iftekhar
BIT0220-Iftekhar
Administrator-RC

Course(s) :
  • BIT

Blood Group : B+
Posts : 434
Points : 630

http://iftekharunplugged.blogspot.com

Back to top Go down

Back to top

- Similar topics

IITDU Forum :: Academics (BIT) :: Semester 3 :: CSE 301

 
Permissions in this forum:
You cannot reply to topics in this forum