Services & ResourcesWolfram ForumsMathGroup Archive

[Date Index] [Thread Index] [Author Index]

Re: Strongly connected graph in mathematica 8?

• To: mathgroup at smc.vnet.net
• Subject: [mg126870] Re: Strongly connected graph in mathematica 8?
• From: Bob Hanlon <hanlonr357 at gmail.com>
• Date: Thu, 14 Jun 2012 05:33:20 -0400 (EDT)
• Delivered-to: l-mathgroup@mail-archive0.wolfram.com
• References: <201206130856.EAA03707@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 at 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

• References:
  • Strongly connected graph in mathematica 8?
    • From: Nuno <crichigno@gmail.com>