|
[Date Index]
[Thread Index]
[Author Index]
Strongly connected digraph
- To: mathgroup at smc.vnet.net
- Subject: [mg47412] Strongly connected digraph
- From: "Diana" <diana53xiii at earthlink.remove13.net>
- Date: Fri, 9 Apr 2004 04:45:28 -0400 (EDT)
- Reply-to: "Diana" <diana53xiii at earthlink.remove13.net>
- Sender: owner-wri-mathgroup at wolfram.com
Hi,
Does anyone know of programs or algorithms to find maximal strongly
connected subgraphs in a digraph? Or, strongly connected components, etc.
Thanks,
Diana
--
=====================================================
"God made the integers, all else is the work of man."
L. Kronecker, Jahresber. DMV 2, S. 19.
Prev by Date:
RE: Why do two equivalent expression give different answers?
Next by Date:
Re: Why do two equivalent expression give different answers?
Previous by thread:
Re: fixed point _convergence _check
Next by thread:
Re: Strongly connected digraph
|