| To: | "'s-news@lists.biostat.wustl.edu'" <s-news@lists.biostat.wustl.edu> |
|---|---|
| Subject: | DFS (depth first search) |
| From: | Stafford Phillip-APS095 <phillip.stafford@motorola.com> |
| Date: | Fri, 16 Nov 2001 09:29:29 -0600 |
Anyone know a method for simulating dfs in S+? I'd like to use the strongly connected components algorithm (black, white, grey) to create nodes from a depth search in the same way that it's implemented in C++. Also, I think Nick Ellis is gunning for the "Most Informed S+ Data Manipulator" award for November. I've yet to run into someone who is so informed about moving data around in the S language. My vote's cast. Thanks for any advice; Phillip Stafford Statistical Informatics Biomining.com |
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: what are these files, David Brahm |
|---|---|
| Next by Date: | Memory Problem?, Li, Qishan |
| Previous by Thread: | summary - detecting spatial units that have no neighbors, M Kshatriya |
| Next by Thread: | Memory Problem?, Li, Qishan |
| Indexes: | [Date] [Thread] [Top] [All Lists] |