Object Oriented implementation of graph data structures

Question

I have been reading quite a bit graph data structures lately, as I have intentions of writing my own UML tool. As far as I can see, what I want can be modeled as a simple graph

Answer 1

An adjacency matrix will have a bit more difficulty than your object model in adding and removing vertices (but not edges), since this involves adding and removing rows and columns from a matrix. There are tricks you could use to do this, like keeping empty rows and columns, but it will still be a bit complicated.

When moving a vertex around the screen, the edges will also be moved. This also gives your object model a slight advantage, since it will have a list of connected edges and will not have to search through the matrix.

Both models have an inherent directedness to the edges, so if you want to have undirected edges, then you will have to do additional work either way.

I would say that overall there is not a whole lot of difference. If I were implementing this, I would probably do something similar to what you are doing.