Edge Arrays
The data type edge_array<E> can be used to associate additional
(LEDA or user
defined) information of type E with the edges of a graph.
Example of how to
use a edge array for a graph
Strengths
 more efficient access than with Edge Maps
 there can be an arbitrary number of Edge Arrays for a graph
 Edge Arrays can be defined at any point in a program
Disadvantages
 less efficient than Parameterized Graphs
 only works well for static graphs: A new edge will not have a corresponding
entry in the Edge Array (explicit
init() is necessary)
 cost of declaring an Edge Array is proportional to the number of edges
in the graph
Tips
 Edge Arrays are primarily useful for static graphs. They are the most
convenient and most widely used way to associate information with edges
of static graphs and for dense arrays, that is, most of edges need an
entry.
 Using Edge Arrays for highly dynamic graphs is quite inconvenient.

See also:
Parameterized Graphs
Edge Maps
Associate Information with
Graphs
Graphs and Related Data Types
Arrays
Manual Entries:
Manual
Page Edge Arrays
User
Defined Parameter Types
