I'm working on a project, on an app, that can visualize undirected graphs and show on this domination algorithm. There are some examples:
I have some open questions about programmable solution of this problem. I use lists to store vertices of generated graph, but I do not know how can I store edges, that connects the dominated vertices? Like how should I store edges in example C? 2 red vertices dominating all others.