LEDA is a library of data types and algorithms for combinatorial and geometric computing. It provides a wide range of data structures and algorithms, including stacks, queues, lists, dictionaries, graphs, and geometric structures like convex hulls and Voronoi diagrams. LEDA is designed to be used by non-experts and allows for efficient implementation of complex data types and algorithms. It is implemented in C++ and includes a variety of data types and algorithms that are essential for applications in areas such as computational geometry, graph theory, and discrete optimization. LEDA offers a precise and readable specification for each data type and algorithm, and many data types are parameterized to allow flexibility. It also provides efficient implementations of data structures, including the ability to choose between different implementations for certain data types. LEDA includes a data type for graphs, which allows for efficient graph algorithms and provides a way to write programs for graph problems in a form close to the typical textbook presentation. LEDA also includes a data type for windows, which allows for graphical output and mouse input. It supports applications in a broad range of areas, including code optimization, VLSI design, robot motion planning, traffic scheduling, machine learning, and computational biology. LEDA is available via anonymous ftp and can be used freely for research and teaching purposes. LEDA is a platform for combinatorial and geometric computing that provides a comprehensive set of data types and algorithms. It is designed to be used by both researchers and practitioners, and it has been shown to be efficient and effective in a variety of applications. LEDA is available for use with any C++ compiler that supports templates and is widely used in the field of computer science.LEDA is a library of data types and algorithms for combinatorial and geometric computing. It provides a wide range of data structures and algorithms, including stacks, queues, lists, dictionaries, graphs, and geometric structures like convex hulls and Voronoi diagrams. LEDA is designed to be used by non-experts and allows for efficient implementation of complex data types and algorithms. It is implemented in C++ and includes a variety of data types and algorithms that are essential for applications in areas such as computational geometry, graph theory, and discrete optimization. LEDA offers a precise and readable specification for each data type and algorithm, and many data types are parameterized to allow flexibility. It also provides efficient implementations of data structures, including the ability to choose between different implementations for certain data types. LEDA includes a data type for graphs, which allows for efficient graph algorithms and provides a way to write programs for graph problems in a form close to the typical textbook presentation. LEDA also includes a data type for windows, which allows for graphical output and mouse input. It supports applications in a broad range of areas, including code optimization, VLSI design, robot motion planning, traffic scheduling, machine learning, and computational biology. LEDA is available via anonymous ftp and can be used freely for research and teaching purposes. LEDA is a platform for combinatorial and geometric computing that provides a comprehensive set of data types and algorithms. It is designed to be used by both researchers and practitioners, and it has been shown to be efficient and effective in a variety of applications. LEDA is available for use with any C++ compiler that supports templates and is widely used in the field of computer science.