Graph Data Types

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.

• Graphs
• Parameterized Graphs
• Planar Maps
• Parameterized Planar Maps

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

• Sets of Nodes
• Sets of Edges
• Lists of Nodes
• Node Partitions
• Node Priority Queues
• Bounded Node Priority Queues
• Data Types to Associate Information with Graphs
  (like node arrays and edge maps)

Additional Functions and Data Types:

• Graph Generators
• Misc Graph Functions
• Markov Chains and Dynamic Markov Chains
• GML Parser
• LEDA Native Graph File Format