engleski

A Generic C++ Implementation Of Composite Path Algebras

Path problems are a family of problems which reduce to determination or evaluation of paths in directed graphs. A general way of solving path problems is to use a suitable algebraic framework, where instances of the underlying algebraic structure are called path algebras. In a previous paper, we have proposed a method for combining already known path algebras into composite path algebras. This paper considers implementation aspects of the proposed method, and describes a generic C++ library of classes and functions based on the use of composite algebras. The library is implemented in a flexible manner, so that various types of complex path problems can easily be solved, as it is demonstrated by concrete examples.

directed graphs; path problems; path algebras; generic programming; C++ programming language

nije evidentirano