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

*From*: fl <freder...@xxxxxxxxxxx>*Date*: Fri, 17 Apr 2015 09:46:55 -0700 (PDT)*References*: <d9e17617-918f-45e5-bf68-fd3e8bb283b3@googlegroups.com> <CACToG-8dXGossWjNAhMHDZEc=tnHOzrQ+xKUyiWLiL3OLzL5Lw@mail.gmail.com>

I'd like to just add that sets are very natural in describing algorithms :-)-- given a set e of edges and a set s of vertices, compute-- set r of vertices reachable from vertices in s following edges in e:r := swhile exists v in {v: (u,v) in e, u in r, v not in r}:r := r + {v}

Hi Annie,

it's sure it is more synthetic.

I think Stephan has the answer below. In standard use sets, and if needed because your language

is low level, refine. That's what I will do.

--

FL

**References**:**Sets and arrays***From:*fl

**Re: [tlaplus] Sets and arrays***From:*Annie Liu

- Prev by Date:
**Re: Sets and arrays** - Next by Date:
**Re: [tlaplus] Re: Resolved: TLA toolbox crash/segfault complaining of libsoup on Linux** - Previous by thread:
**Re: [tlaplus] Sets and arrays** - Next by thread:
**Re: [tlaplus] Sets and arrays** - Index(es):