Hi guys
I'm recently trying to study the Hopcroft-Karp Algorithm
that can compute the maximum matching of a bipartite
graph in O(sqrt(n)*m) complexity.
However I find it not so easy to understand.
Can anybody help me explaining how the algorithm works
or give me a working implementation of HK
Heya!
A bit offtopic.
I was looking for the previous asigments/solutions on the CodeJam site
but couldn't find none.. Can someone provide a link?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
Goto www.topcoder.com
-Original Message-
From: algogeeks@googlegroups.com [mailto:[EMAIL PROTECTED] On
Behalf Of [EMAIL PROTECTED]
Sent: Monday, August 21, 2006 7:38 PM
To: Algorithm Geeks
Subject: [algogeeks] Re: fwd : google code jam 2006
Heya!
A bit offtopic.
I was looking for
Hello algorithm enthusiasts! I recently became interested in
Minesweeper-solving algorithms, and would like to propose a
competition.
We will each write a C/C++/Java function that takes a minesweeper
board, along with its width and height, and then returns which square
to click next. For
Hi Jeff,
Glad to hear you say on average in judging the algorithm's, because
minesweeper is all about probablities, imo. Even the best algo could be
foiled by an unlucky guess.
If you have an algo for this probabibility calculation, until you find
a square with 100% safety, (or the safest
RE: If you have an algo for this probabibility calculation, until you
find
a square with 100% safety, (or the safest square on the board), you
have minesweeper solved as well as it can be.
In fact, this is not true. Simply selecting the square that minimizes
the probability of uncovering a
