[R] cycle in a directed graph

Jeff Newmiller jdnewmil at dcn.davis.CA.us
Sun May 3 19:50:26 CEST 2015

Lacking any reference to R, this message is off-topic on this mailing list. You might try math.stackexchange.com.
Jeff Newmiller                        The     .....       .....  Go Live...
DCN:<jdnewmil at dcn.davis.ca.us>        Basics: ##.#.       ##.#.  Live Go...
                                      Live:   OO#.. Dead: OO#..  Playing
Research Engineer (Solar/Batteries            O.O#.       #.O#.  with
/Software/Embedded Controllers)               .OO#.       .OO#.  rocks...1k
Sent from my phone. Please excuse my brevity.

On May 3, 2015 8:36:29 AM PDT, Dany <daniela_scida at brown.edu> wrote:
>Hi I saw the answer: 
>�If the graph has n nodes and is represented by an adjacency matrix,
>you can square the matrix (log_2 n)+1 times. Then you can multiply the
>matrix element-wise by its transpose. �
>I�m a PhD student working on my research and I need to check for cycles
>in a directed graph to make sure it is a DAG. The answer given is
>extremely useful but I need the theorem statement, or a reference. Do
>you have a book where this is stated or a paper?
>	[[alternative HTML version deleted]]
>R-help at r-project.org mailing list -- To UNSUBSCRIBE and more, see
>PLEASE do read the posting guide
>and provide commented, minimal, self-contained, reproducible code.

More information about the R-help mailing list