Re: Strongly connected digraph
- To: mathgroup at smc.vnet.net
- Subject: [mg47415] Re: Strongly connected digraph
- From: "Steve Luttrell" <steve_usenet at _removemefirst_luttrell.org.uk>
- Date: Sat, 10 Apr 2004 02:01:20 -0400 (EDT)
- References: <firstname.lastname@example.org>
- Sender: owner-wri-mathgroup at wolfram.com
I don't know what you mean by "digraph" but here is an example of the
general sort of thing that I think you want to do:
I copied this example from the Computational Discrete Mathematics book that
explains how to REALLY use the DiscreteMath`Combinatorica` package.
Alternatively, if you input ?StronglyConnectedComponents to Mathematica you
get back the following rather limited information:
"StronglyConnectedComponents[g] gives the strongly connected components of
directed graph g as lists of vertices."
"Diana" <diana53xiii at earthlink.remove13.net> wrote in message
news:c55o54$34v$1 at smc.vnet.net...
> Does anyone know of programs or algorithms to find maximal strongly
> connected subgraphs in a digraph? Or, strongly connected components, etc.
> "God made the integers, all else is the work of man."
> L. Kronecker, Jahresber. DMV 2, S. 19.
Prev by Date:
Re: Is there any productive way to use Mathematica + pdfLaTeX?
Next by Date:
Adding hyperlinks to help browser files in function::usage
Previous by thread:
Strongly connected digraph
Next by thread:
discrete data from a surface