I'm beginning to understand Classes and I thought I would implement somethig
usefull for my studies, a graph. Basically, a graph is a set of nodes (points)
with a (variable) number of links (sticks) going (pointing) to other nodes.
The part "set of nodes" is kind of simple... but the "node" part is where it gets tricky (for me at least).
To implement this I tried :
1 2 3 4 5 6 7 8
link **linkPointer; // a dynamic array of links (or so I think)
node* to; // pointer to a node Class
I think I understand why this fails. I'm declaring something circular, meaning link needs node, and node needs link.
I thought this was quite simple... turns out it is not THAT simple.
Any ideas how can I implement this??
While this can be done quite easily, it doesn't make a lot of sense for edges to have their own class. Edges are merely the things that connect two nodes, and C++ already has something like that: pointers.
Well... yes, pointers can do that, but the thing is that (eventually) these links will have LOTS of properties like how "strong" the bond is, how "far" does it go... they may enven have their own functions .... that is why I put the links in a separate class.... so that they can the can GROW.
Just didn't want to bother everyone with the details of further implementations. I tried to get the essence of a graph.