A Generic C++ Library for Solving Path Problems

Abstract

Path problems are a family of frequently encountered optimization and enumeration problems. Although they are specific each for itself, theory provides a mathematical framework for treatment of path problems in a general way. In this paper we describe a generic C++ library based on algebraic approach for solving path problems. The classes and functions in the library are very compact and written with the intention to be extensively combined. In this way, many different concrete path problems can be solved by using the same set of programming components.