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

*To*: K McElroy <k_k_m@xxxxxxxxxxx>*Subject*: Re: [PVS-Help] Sets-reaching their individual elements, Graphs*From*: Natarajan Shankar <shankar@xxxxxxxxxxx>*Date*: Fri, 19 Oct 2007 00:36:39 -0700*Cc*: pvs-help@xxxxxxxxxxx*Comments*: In-reply-to K McElroy <k_k_m@hotmail.com>message dated "Wed, 17 Oct 2007 19:17:35 -0400."*In-reply-to*: <BAY134-W183E016B5B62CAE572D790A29D0@phx.gbl>*List-Help*: <mailto:pvs-help-request@csl.sri.com?subject=help>*List-Id*: PVS-Help <pvs-help.csl.sri.com>*List-Post*: <mailto:pvs-help@csl.sri.com>*List-Subscribe*: <http://lists.csl.sri.com/mailman/listinfo/pvs-help>,<mailto:pvs-help-request@csl.sri.com?subject=subscribe>*List-Unsubscribe*: <http://lists.csl.sri.com/mailman/listinfo/pvs-help>,<mailto:pvs-help-request@csl.sri.com?subject=unsubscribe>*References*: <BAY134-W183E016B5B62CAE572D790A29D0@phx.gbl>*Sender*: pvs-help-bounces+archive=csl.sri.com@xxxxxxxxxxx

Kelly: It would help to know more about your representation for graphs. If the set of edges, say A, is a subset of some finitely enumerable set like an integer subrange, then you could scan the subrange and pick out the edges in A. It is also possible that the operations you wish to perform do not require the set elements to be enumerated, e.g., taking the maximum or minimum, or computing the image of the set with respect to a map. However, such operations might not be executable. Alternately, you could use an adjacency list representation for the edges out of a vertex. Cheers, Shankar K McElroy <k_k_m@hotmail.com> wrote: > Is there anyway to go through each individual elements of a set? > I am using a graph where extra information is going to be tagged onto the e= > dges of a vertex, in order to get the correct path. So i will travel to eac= > h vertex and obtain the edges it has to get the other piece of information.= > However I will not know how many edges a vertex has or which edge I would = > like to leave the vertex on, therefore I am looking at going through all th= > e edges the vertex has. > =20 > Any suggests would be much apprecaited.=20 > =20 > Because I'm using graphs and much of the code I need is already written I w= > ould like to stay with sets if at all possible. > =20 > =20 > Thanks > Kelly =20

**References**:**[PVS-Help] Sets-reaching their individual elements, Graphs***From:*K McElroy

- Prev by Date:
**[PVS-Help] Sets-reaching their individual elements, Graphs** - Next by Date:
**[PVS-Help] Installation** - Prev by thread:
**[PVS-Help] Sets-reaching their individual elements, Graphs** - Next by thread:
**[PVS-Help] inequalities in PVS** - Index(es):