Algorithmic Solutions > LEDA > LEDA Guide > Graphs and Related Data Types

Graph Data Types

Graphs and their data types are very central to LEDA. A graph G=(V,E) consists of a set of nodes V and a set of pairs of nodes E, called edges.

Graphs are a convenient tool to model relations between objects, for example, cities and streets connecting the cities, or objects and relations between objects in a data base. The objects are modeled as nodes of the graph and there is an edge in the graph between two nodes if the corresponding objects are related.

Graphs can be used in many different application areas and for many different purposes.

LEDA provides the following data types for representing graphs.

Complete Example for Graphs and Related Data Types

See also:

How to Associate Information with graphs

Graph Algorithms

GraphWin for visualizing graphs and graph algorithms

Manual Entries:

Manual Page Graphs and Related Data Types

Graph Related Data Types

Additional Functions and Data Types:

Please send any suggestions, comments or questions to
© Copyright 2001-2003, Algorithmic Solutions Software GmbH