Generated: July 29, 2004, 07:56:14 | | A SchemeDoc Manual |
Rooster Graph - Properties
Jonah Nathaniel Beckford © 2004
Source file: rgraph-prop.scm
LAML Version 23.00 (December 12, 2003, full) A property getter is a procedure (lambda
(graph vertex-or-edge))
that gets an arbitrary scheme
object that is associated with the vertex-or-edge in graph.
A property setter is a procedure (lambda
(graph vertex-or-edge value))
that associates an arbitrary
scheme object to the vertex-or-edge in graph.
A property map is a pair (cons
property-getter property-setter!)
, whose car is a property
getter and whose cdr is a property setter.
A property key is a vertex or an edge, dependent
upon whether the context is a vertex property or an edge
property, respectively.
Table of Contents: Alphabetic index: 1 Properties. |
The internal properties are defined when you define the graph.
See Adjacency List for an example.
|
|
prop-external-hash |
Form | (prop-external-hash eq? [num]) |
Description | Create an external property map on top of a hashtable.
|
Parameters | eq? | A procedure that will equality compare two property keys. |
num | Optional. The initial size of the hash-table. |
Returns | A property map. |
|
prop-external-vector |
Form | (prop-external-vector [num]) |
Description | Create an external property map on top of a vector. The property
key must be an integer.
|
Parameters | num | Optional. The initial size of the vector |
Returns | A property map. |
|
Generated: July 29, 2004, 07:56:15
Generated by LAML SchemeDoc .