Graph::Bipartite - Graph algorithms on bipartite graphs.

++

++

This algorithm computes the maximum matching of a bipartite unweighted and undirected graph in worst case running time O( sqrt(|V|) * |E| ). The constructor takes as first argument the number of vertices of the first partition V1, as second argument ...

DETZOLD/Graph-Bipartite-0.01 - 25 May 2003 21:25:37 UTC - Search in distribution

Algorithm::MinMax - Finding the minimum and maximum of an array with at most 3n/2 - 2 comparisons.

++

++

The implementation finds the minimum and maximum of a given array with at most 3n/2 - 2 comparisons, where n is the number of elements of the array....

DETZOLD/Algorithm-MinMax-0.01 - 27 May 2003 17:59:35 UTC - Search in distribution