Isn't it Strongly connected component?
Take a look:
http://en.wikipedia.org/wiki/Strongly_connected_component
On Oct 21, 9:15 am, mithun wrote:
> Given a graph can anyone suggest me good algorithm to find out Number
> of Cycles in a Graph..
>
> -Thanks
> Mithun
--~--~-~--~~---
Isn't it the same of adding two random numbers
When you just add two random numbers, you tend to normalize them. If
you simply multiply one
of them by 5 before adding with the other, you'll end up normalizing
them the same way...
On 18 set, 18:45, eSKay wrote:
> okay now I get it.
>
> but
There are two diagonals: up-left to bottom-right and bottom-left to up-
right. So, it would
be 4n "words" to search for the substring.
On 17 set, 16:47, Arun wrote:
> Form a word with each row(concatenation of all chars in the row). Similarly
> for column and diagonal.
> There would be 3n words
