Special Graph Constructor G ( int n, int e)
The constructor G(int n_slots, int e_slots) is a special
constructor for the data type graph that extends
the possibilities of Parameterized Graphs
to associate information with the nodes and edges of a graph. It specifies
the number of free data slots in the nodes and edges of a graph that can
be used for storing entries of Node Arrays
and Edge Arrays.
Usage
of Special Graph Constructor
Strengths
Disadvantages
- number of needed slots must be known beforehand
Tips
- Experiment with the alternative design during the optimization phase
of program development.
- Use node/edge data slots if speed is of utmost importance and node/edge
information is accessed many times in random order.
|
See also:
Parameterized Graphs
Node Arrays
Edge Arrays
Associate Information with
Graphs
Graphs and Related Data Types
Manual Entries:
Manual
Page Graphs
User
Defined Parameter Types
|