morrison@cs.ubc.ca (Rick Morrison) (11/28/90)
So, I am embarking on my first object-oriented programming project. The basic
idea is to model a graph as a system of "node objects."
The in- and out-edges in the graph are to be recorded locally in each node
object. Nodes are to be added and deleted by object creation and deletion.
In the intended application the number of adjacent nodes for
any given node is small, relative to the total number of nodes.
The question is, how does this representation scale up? For what size
networks (total number of nodes) is such an approach feasible?
Any opinions on this or alternative approaches gratefully accepted.
-----------------------
Rick Morrison | {alberta,uw-beaver,uunet}!ubc-cs!morrison
Dept. of Computer Science| morrison@cs.ubc.ca
Univ. of British Columbia| morrison%ubc.csnet@csnet-relay.arpa
Vancouver, B.C. V6T 1W5 | morrison@ubc.csnet (ubc-csgrads=137.82.8.20)
(604) 228-5010