brute-force search help

[mimis]

I need to learn brute-force search because i think that it will help me to solve a problem on graphs.

Do you know any good tutorial for brute-force search?

[Sky Diploma]

You should try googling it out Clicky
Though its very easy.

[mimis]

I tried googling before i posted it here but i didn't find any tutorial.
Someone may know any book as well.

[Narue]

There's probably not a tutorial because there's nothing to it. Brute force searching is the dumbest, easiest (and often most inefficient) way you can think of to get the correct answer. In the case of a graph, you'd probably end up doing a recursive traversal of all nodes.

Why don't you tell us what problem you're trying to solve instead of asking vague questions about the solution you think you need.

[skatamatic]

here's a brute force template

for (int i = 0; i < MAX_NUMBER; i++)
{
    if (Condition[i] == Desirable)
          DoFunction();
    else
          DoOtherFunction();
}

[mimis]

Narue, I have posted the problem here: http://www.daniweb.com/forums/thread177852.html
Help me to find a solution if you can.