A generic C++ implementation of composite path algebras

被引：0

作者：

Botincan, M ^{[1
]}

Manger, R ^{[1
]}

机构：

[1] Univ Zagreb, Dept Math, Zagreb 10000, Croatia

来源：

Proceedings of the 10th International Conference on Operational Research - KOI 2004 | 2005年

关键词：

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

D O I：

暂无

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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 demonstrated by concrete examples.

引用

页码：155 / 164

页数：10