Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #10461 > unrolled thread

Re: Strongly connected graph in mathematica 8?

Started byBob Hanlon <hanlonr357@gmail.com>
First post2012-06-14 09:35 +0000
Last post2012-06-14 09:35 +0000
Articles 1 — 1 participant

Back to article view | Back to comp.soft-sys.math.mathematica

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  Re: Strongly connected graph in mathematica 8? Bob Hanlon <hanlonr357@gmail.com> - 2012-06-14 09:35 +0000

#10461 — Re: Strongly connected graph in mathematica 8?

FromBob Hanlon <hanlonr357@gmail.com>
Date2012-06-14 09:35 +0000
SubjectRe: Strongly connected graph in mathematica 8?
Message-ID<jrcb9i$dta$1@smc.vnet.net>
g1=Graph[{1\[DirectedEdge]2,2\[DirectedEdge]3,
    3\[DirectedEdge]1,2\[DirectedEdge]4}];

ConnectedGraphQ[g1]

False

g2=Graph[{1\[DirectedEdge]2,2\[DirectedEdge]3,
    3\[DirectedEdge]1,2\[DirectedEdge]4,4\[DirectedEdge]2}];

ConnectedGraphQ[g2]

True


Bob Hanlon


On Wed, Jun 13, 2012 at 4:56 AM, Nuno <crichigno@gmail.com> wrote:
> Hi, I have a simple question:
>
> How can I check if a directed graph is strongly connected in
> Mathematica 8? The imput
>
> ConnectedComponents[q]
>
> does not lead to anything using << DiscreteMath`Combinatorica` .
>
> Thanks a lot!
>



-- 
Bob Hanlon

[toc] | [standalone]


Back to top | Article view | comp.soft-sys.math.mathematica


csiph-web