On 26 srp, 10:33, ankur aggarwal <[email protected]> wrote:
> given a directed graph and node n1 and n2
> find all possible path between them
>
> i think graph is acyclic ..
> otherwise there are infinte path we can write
>
> eg
>
> for node "a" and "d" are there
> we have a cycle node "b" to "c" and "c" to "b"
>
> a-> b->c->b->d
> a-> b->c->b->c->b->d
> etc
1) Is the graph oriented, or unoriented?
2) Is it a tree?
Incidence matrices S for oriented and G for unoriented graphs differ.
At trees, GG^T and SS^T are n-multiples of inversed quadratic forms
of walk (path) matrices W^(T)W, which elements are numbers of path
(selfavoiding walks) in which the edge (arc) i is present together
with the edge (arc) j.
kunzmilan
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
