[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Path algorithm
From: |
Owen Densmore |
Subject: |
Re: Path algorithm |
Date: |
Mon, 05 Mar 2001 15:16:48 -0800 |
Hi! Did you get any interesting responses? I'm modeling a Peer to Peer
set of nodes and hope to start "coverage" analysis shortly, and I think
any algorithms helping your fish will help my nodes and nets.
Owen
M Lang / S Railsback wrote:
>
> I need an algorithm to see if you can get from one place in a Grid2D to
> another region of the grid.
>
> Say there are a patch of connected grid cells that are "safe" for my
> fish. The other cells are either wet or dry, and the fish can only move
> through wet cells. I need to determine for each wet cell whether or not
> there is a connection through the other wet cells to the "safe" patch.
>
> Does anyone have an efficient algorithm for this?
>
> Thanks
>
> Steve
> --
> address@hidden
> Lang, Railsback & Assoc.
> 250 California Ave., Arcata CA 95521
> 707-822-0453; Fax 822-1868
>
> Until July 1, 2001:
> Los Alamos, NM
> 505-661-4258
>
> ==================================
> Swarm-Modelling is for discussion of Simulation and Modelling techniques
> esp. using Swarm. For list administration needs (esp. [un]subscribing),
> please send a message to <address@hidden> with "help" in the
> body of the message.
> ==================================
owen.vcf
Description: Card for Owen Densmore