engleski

A library of subroutines for solving path problems

Path problems are a family of optimization and enumeration problems, which reduce to determination of paths in a directed graph. In this paper we describe a partially realized library of subroutines for solving path problems. The library is written in the C language, and is based on the algebraic approach to path problems. The modules from our library are relatively simple, but they can be combined. In this way, different types of concrete path problems can be solved by using the same set of general algorithms.

directed graphs; path problems; algebraic approach; subroutine library; C programming language

nije evidentirano