An object-oriented design and implementation of reusable graph objects with C++

Wing Ning Li, Ravi Kiran
1996 Proceedings of the 1996 ACM symposium on Applied Computing - SAC '96  
In its basic form, a graph consists of a set of vertices and a set of edges. Infinitely many variations, however, can be defined from it. One may associate any set of attributes with the set of vertices and edges (resulting directed and undirected graphs, flow networks, finit e state diagrams, vertex weighted graphs, etc.), or associate any set of restrictions with the set of vertices and edges (resulting acyclic graphs, bipartite graphs, planar graphs, interval graphs, etc.). Various graphs
more » ... e been implemented and embedded in today's software systems. In this paper, we study the issues of reusable design and propose a design and implementation of reusable graph objects using object-oriented concepts so that graph objects can be adapted to new or revised applications.
doi:10.1145/331119.331433 dblp:conf/sac/LiK96 fatcat:3dzft6frnzhmtf35tg4wwshwoi