LEMON Tutorial

Table of Contents

• 1 Introduction
  • 1.1 What is LEMON
  • 1.2 LEMON Tutorial
• 2 Compile Your First Code
• 3 Basic Concepts
  • 3.1 Directed Graphs
  • 3.2 Iterators
  • 3.3 Maps
  • 3.4 Naming Conventions
• 4 Algorithms
  • 4.1 Graph Search
  • 4.2 Shortest Paths
  • 4.3 Maximum Flows
• 5 Undirected Graphs
  • 5.1 Working with Undirected Graphs
  • 5.2 Undirected Graph Algorithms
• 6 Basic Graph Utilities
  • 6.1 Count Graph Items
  • 6.2 Copying a Graph
  • 6.3 Type Definitions
  • 6.4 Special Graph Maps
• 7 Maps
  • 7.1 Map Concepts
  • 7.2 Creating Own Maps
  • 7.3 Map Adaptors
  • 7.4 Using Algorithms with Special Maps
• 8 Graph Structures
  • 8.1 Graph Concepts
  • 8.2 Directed Graph Structures
  • 8.3 Undirected Graph Structures
• 9 Graph Adaptors
  • 9.1 Reverse Oriented Digraph
  • 9.2 Subgraph Adaptorts
  • 9.3 Other Graph Adaptors
• 10 Linear Programming Interface
  • 10.1 Basic LP Features
  • 10.2 Mixed Integer Programming
  • 10.3 Solving Complex Optimization Problems
• 11 LEMON Graph Format
• 12 Tools
  • 12.1 Auxiliary Data Structures
  • 12.2 Postscript Exporting
  • 12.3 Time Measuring and Counting
  • 12.4 Random Number Generation
  • 12.5 Argument Parser
• 13 gLemon
• 14 License Terms