LEMON - an Open Source C++ Graph Template Library

This paper introduces LEMON, a generic open source C++ library providing easy-to-use and efficient implementations of graph and network algorithms and related data structures. The basic design concepts, features, and performance of LEMON are compared with similar software packages, namely BGL (Boost Graph Library) and LEDA. LEMON turned out to be a viable alternative to these widely used libraries, and our benchmarks show that it typically outperforms them in efficiency.

[1]  T. Cinkler,et al.  A Randomized Cost Smoothing Approach for Optical Network Design , 2007, 2007 9th International Conference on Transparent Optical Networks.

[2]  Andrew V. Goldberg,et al.  An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.

[3]  Yannis Smaragdakis,et al.  Mixin-Based Programming in C++ , 2000, GCSE.

[4]  Eiji Oki,et al.  GLPK (GNU Linear Programming Kit) , 2012 .

[5]  Zoltán Porkoláb,et al.  Towards a General Template Introspection Library , 2004, GPCE.

[6]  Jeremy G. Siek,et al.  The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.

[7]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[8]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[9]  Bjarne Stroustrup.  The Design of C++0x Reinforcing C++'s proven strengths, while moving into the future , 2005 .

[10]  Tibor Cinkler,et al.  MPP: Optimal Multi-Path Routing with Protection , 2008, 2008 IEEE International Conference on Communications.

[11]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[12]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[13]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[14]  Sandeep Koranne,et al.  Boost C++ Libraries , 2011 .

[15]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[16]  A. Juttner,et al.  QoS Aware and Fair Resource Allocation Scheme in Transport Networks , 2006, 2006 International Conference on Transparent Optical Networks.

[17]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[18]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[19]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[20]  Péter Kovács,et al.  Column Generation Method for an Agent Scheduling Problem , 2010, Electron. Notes Discret. Math..