Re: [Boost-users] [BGL] simple problem: how to detect connections in a dag?

Subject: Re: [Boost-users] [BGL] simple problem: how to detect connections in a dag?
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-01-06 18:54:00

On Wed, 6 Jan 2010, Olaf Krzikalla wrote:

> Hi @boost,
>
> Jeremiah Willcock schrieb:
>> I think the question was asking for a path of arbitrary length; 
> Indeed. Maybe there is a better term for the property "directly or indirectly 
> connected", isn't there?

I believe for a directed path the term is "reachable".

-- Jeremiah Willcock