Implementing non-trivial algorithms, like many graph algorithms, is generally expensive, Thus, it is desirable to reuse such implementations whenever possible. The implementations of graph algorithms normally cannot b...
详细信息
ISBN:
(纸本)3540410902
Implementing non-trivial algorithms, like many graph algorithms, is generally expensive, Thus, it is desirable to reuse such implementations whenever possible. The implementations of graph algorithms normally cannot be reused mainly because the representations of graphs 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.
暂无评论