Face Maps
The data type face_map<E> can be used to associate additional
(LEDA and user
defined) information of type E with the faces of an embedded planar
graph.
Example of how to use
a face map for a graph
Strengths
- works well for dynamic graphs
- efficient: initializiation in constant time and access in expected
constant time
- there can be an arbitrary number of Face Maps for a graph
- Face Maps can be defined at any point in a program
- can be passed (by reference) to a function with Face
Array as formal parameter.
Disadvantages
Tips
- Use Face Maps in situations where a sparse map on the faces
has to be maintained.
- If more than half of the entries are actually used it is often better
to use a Face Array.
|
See also:
Parameterized Graphs
Face Arrays
Associate Information with
Graphs
Graphs and Related Data Types
Maps
Manual Entries:
Manual
Page Face Maps
User
Defined Parameter Types
|