If A is the adjacency matrix of the graph, the entry (i, j) of the
matrix A^k is the number of paths of length k between i and j.
On May 5, 11:42 am, jeth <[EMAIL PROTECTED]> wrote:
> Hi, for a long time I'm having a problem with one graph algorithm.
> After checking two and spending few days on
On May 5, 5:42 pm, jeth <[EMAIL PROTECTED]> wrote:
> Hi, for a long time I'm having a problem with one graph algorithm.
> After checking two and spending few days on it I've no more ideas what
> to do. Maybe you can give me some pieces of advice which algorithm
> should I use to solve such probl
@Jeth
Hi
Just thot a Soln
Since we need to check whether the length of any path btw any two
nodes in a grph
it s enough if we checkwhether the Height of DFS tree [/Forest] is max
of 2.
If so then the ttask underlying is accomplished.
Notify if my intution s not crt
Open 4 comments
Regards
