I'm working on a project, on an app, that can visualize undirected graphs and show on this domination algorithm. There are some examples:

Dominating graphs

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.

  • 1
    Did you take a look at the standard representations? – 9000 Mar 6 '15 at 23:59
  • 1
    Generally, either you use an adjacency list/matrix, or you use a container of pairs of points. Do you need help choosing between these options, or understanding the options, or is there something about this "domination algorithm" that constrains what representations would be acceptable? – Ixrec Mar 7 '15 at 0:57
  • The used graph generation algorithm works with lists. So graph's data is stored already. I can't know how to represent dominating data, how to work with this algorithm in Java. – plaidshirt Mar 7 '15 at 21:06

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.