[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

*To*: gyro@zeta-soft.com*Subject*: Re: Directed graph package?*From*: R.W.Butler@larc.nasa.gov*Date*: Thu, 10 Dec 1998 14:03:40 -0400 (GMT-0400)*Cc*: pvs-help@csl.sri.com*In-Reply-To*: <199812100941.BAA04432@kali.zeta-soft.com>*References*: <199812100941.BAA04432@kali.zeta-soft.com>*Reply-To*: R.W.Butler@larc.nasa.gov

> I want to prove some properties of some algorithms that walk directed graphs > -- for the moment I'm mostly interested in DAGs, but at some point would like > to handle arbitrary directed graphs. Does anyone have a handy theory or > collection of theories that supports this? A theory of (undirected) graphs is avaiable at http://shemesh.larc.nasa.gov/ftp/larc/PVS-library/ I will try replacing doubleton with ordered pair in the definition of graph and see how many theorems survive. If that looks promising I will try to construct a directed graph version (without the big theorems of menger and ramsey of course). Rick Butler

**References**:**Directed graph package?***From:*"Scott L. Burson" <gyro@zeta-soft.com>

- Prev by Date:
**Directed graph package?** - Next by Date:
**Re: Directed graph package?** - Prev by thread:
**Directed graph package?** - Next by thread:
**Re: Directed graph package?** - Index(es):