Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #10461
| From | Bob Hanlon <hanlonr357@gmail.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Re: Strongly connected graph in mathematica 8? |
| Date | 2012-06-14 09:35 +0000 |
| Organization | Steven M. Christensen and Associates, Inc and MathTensor, Inc. |
| Message-ID | <jrcb9i$dta$1@smc.vnet.net> (permalink) |
| 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@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
Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread
Re: Strongly connected graph in mathematica 8? Bob Hanlon <hanlonr357@gmail.com> - 2012-06-14 09:35 +0000
csiph-web