Version 5.0 The LEDA User Manual

void
void
G.sort nodes(const list& vl)
G.sort edges(const list& el)
makes vl the node list of G.
Precondition: vl contains exactly the nodes of G.
makes el the edge list of G.
Precondition: el contains exactly the edges of G.
void G.sort nodes( ) the nodes of G are sorted increasingly according to
their contents.
Precondition: vtype is linearly ordered.
void G.sort edges( ) the edges of G are sorted increasingly according to
their contents.
Precondition: etype is linearly ordered.
void G.write(string fname) writes G to the file with name fname. The output
operators operator ≪ (ostream&, const vtype&)
and operator ≪ (ostream&, const etype&)(cf. section
1.6) must be defined.
int G.read(string fname) reads G from the file with name fname. The input
operators operator ≫ (istream&, vtype&) and
operator ≫ (istream&, etype&) (cf. section 1.6) must
be defined. Returns error code
1 if file fname does not exist
2 if graph is not of type GRAPH
3 if file fname does not contain a graph
0 if reading was successful.
5. Implementation
Parameterized graph are derived from directed graph. All additional operations for manipulating
the node and edge entries take constant time.