Introduction to algorithms
The generic graph component library
Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library
The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library
| Hi-index | 0.00 |
Implementing non-trivial algorithms, like many graph algorithms, is generally expensive. Thus, it is desirable to reuse such implementations whenever possible. The implementations ofgraph algorithms normally cannot be reused mainly because the representations ofgraphs differ in many ways and the implementations normally assume one specific representation. This article presents an approach to overcoming this problem which is based mainly on special iterators and special means to access data associated with objects.