There is no "graph" or "adjacency list" container in the STL. You have list, vector, map, set, and dequeue. You can implement it using std::list, or even std::map, but there''s not an out-of-the-box solution from STL.

Oh, well, someone should add one then. I will be honest in that I never use it, but I don''t particularly think that is a good practice. If that is all there is to it then no wonder I don''t use it.

Two words:

Cons Cells.

I''ll bite. What''s a con cell?

quote: Original post by Stoffel

I'll bite. What's a con cell?

In answer to your question, I would imagine a con cell is place where convicts are held.

What I said was 'Cons Cells'. Now, at first glance, cons cells might not appear general enough to solve one's problems, but that would likely be becasue you are not changing your perspective on their use. They are the fundamental data structure of LISP, and are used heavily in symbolic processing, which essentially requires a graph data structure.

Here is one simple explanation.





Edited by - bishop_pass on November 9, 2000 11:05:52 AM