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

Help wanted!! urgently

2 posters

IITDU Forum :: TechTalks :: Ask for Help

Go down

Help wanted!! urgently Empty Help wanted!! urgently

Post by ritesh.nec Fri Sep 02, 2011 2:51 am

Hi guys

I am trying to implement the maximum bipartite matching in C. however my code is giving me error. If any one can help me with a code. any algorithm will do for me. Forf Fulkerson/hopcroft or nything else.

Thanks

ritesh.nec
Pre-Alpha Release
Pre-Alpha Release

Course(s) :
  • N/A

Blood Group : NULL
Posts : 1
Points : 3

Back to top Go down

Help wanted!! urgently Empty Re: Help wanted!! urgently

Post by BIT0130-Shakkhor Sat Sep 03, 2011 1:19 am

Could you please post your code here? Debugging maybe easier than writing the whole code from scratch. For bipartite matching, Hopcroft-Karp is a better solution. Ford-Fulkerson isn't specifically suited for this purpose, and will cause more overhead.
BIT0130-Shakkhor
BIT0130-Shakkhor
Programmer
Programmer

Course(s) :
  • BIT

Blood Group : B+
Posts : 209
Points : 328

Back to top Go down

Back to top

- Similar topics

IITDU Forum :: TechTalks :: Ask for Help

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