bipartite-matching | Fulkerson algorithm to find the maximum matching

by SleekPanther Java Version: Current License: No License

X-Ray Key Features Code Snippets Community Discussions(1)Vulnerabilities Install Support

kandi X-RAY | bipartite-matching Summary

bipartite-matching is a Java library typically used in User Interface applications. bipartite-matching has no bugs, it has no vulnerabilities and it has low support. However bipartite-matching build file is not available. You can download it from GitHub.

Extension of a Ford Fulkerson max flow problem using depth first search.

Support

Quality

Security

License

Reuse

Support

bipartite-matching has a low active ecosystem.

It has 5 star(s) with 1 fork(s). There are 1 watchers for this library.

It had no major release in the last 6 months.

bipartite-matching has no issues reported. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of bipartite-matching is current.

Quality

bipartite-matching has no bugs reported.

Security

bipartite-matching has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

License

bipartite-matching does not have a standard license declared.

Check the repository for any license declaration and review the terms closely.

Without a license, all rights are reserved, and you cannot use the library in your applications.

Reuse

bipartite-matching releases are not available. You will need to build from source code and install.

bipartite-matching has no build file. You will be need to create the build yourself to build the component from source.

Top functions reviewed by kandi - BETA

kandi has reviewed bipartite-matching and discovered the below as its top functions. This is intended to give you an instant insight into bipartite-matching implemented functionality, and help decide if they suit your requirements.

Main method for testing
Iterate over the graph and compute the max flow for each vertex
Depth - first search for a vertex in the graph
Checks if the source path exists in the DFS
Add an edge between two vertices
Connects all vertices in right half half to right half
Connects a source to all vertices in left half

Get all kandi verified functions for this library.

bipartite-matching Key Features

No Key Features are available at this moment for bipartite-matching.

bipartite-matching Examples and Code Snippets

No Code Snippets are available at this moment for bipartite-matching.

Community Discussions

Trending Discussions on bipartite-matching

What is time complexity of maximum bipartitie matching algorithm?

QUESTION

What is time complexity of maximum bipartitie matching algorithm?

Asked 2020-Mar-09 at 14:04

Here is the classical problem : - "There are M job applicants and N jobs. Each applicant has a subset of jobs that he/she is interested in. Each job opening can only accept one applicant and a job applicant can be appointed for only one job. Find an assignment of jobs to applicants in such that as many applicants as possible get jobs."

I am using the following code and algorithm to solve the problem : https://www.geeksforgeeks.org/maximum-bipartite-matching/

What will be the time complexity of this algorithm ?

...

ANSWER

Answered 2020-Mar-09 at 14:04

According to this Wikipedia article, the algorithm by Ford & Fulkerson has a runtime complexity of O(|E|f), where |E| is the cardinality of the input's edge set. Note that this runtime bound depends on the optimal value and is pseudo-polynomial.

Source https://stackoverflow.com/questions/60602096

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install bipartite-matching

You can download it from GitHub.
You can use bipartite-matching like any standard Java library. Please include the the jar files in your classpath. You can also use any IDE and you can run and debug the bipartite-matching component as you would do with any other Java program. Best practice is to use a build tool that supports dependency management such as Maven or Gradle. For Maven installation, please refer maven.apache.org. For Gradle installation, please refer gradle.org .

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: