Counting the number of paths in a network
- To: mathgroup at smc.vnet.net
- Subject: [mg64561] Counting the number of paths in a network
- From: John Dickmann <jqd at mit.edu>
- Date: Wed, 22 Feb 2006 05:58:50 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
I am interested in counting the number of paths from a node in a
network back to that node, counting loops (cycles) only once. Is
there any readily available code that does this?
I found some code posted here a few years ago that counts the number
of paths between two nodes, but am having trouble modifying it to
complete the loop (it also enumerates each path, but I'm not really
interested in that).
More academically, is there perhaps a better measurement for the
fundamental feature --namely the number of options available to
someone to get information around a system?
thanks for any help,
John Q. Dickmann
Lean Aerospace Initiative
Massachusetts Institute of Technology
77 Massachusetts Ave.
Cambridge, MA 02139
jqd at mit.edu
Prev by Date:
Re: SetOptions with Column
Next by Date:
Re: Re: Re: Not Using a Text Editor Interface for Mathematica
Previous by thread:
Re: Can't multiply non-square matrices.
Next by thread:
Re: Counting the number of paths in a network