Dominant Set Viewer

Dominant Set Viewer is a cool, free, and open-source tool that helps you tackle the dominating set problem using constraint satisfaction techniques. If you're into graphs and want to understand how they work, this software is for you!

What is a Dominating Set?

So, what exactly is a dominating set? In graph theory, a dominating set for a graph G = (V, E) is basically a group of vertices D within the overall vertex set V. The neat part? Every vertex not in D connects to at least one member of that group through an edge. The domination number γ(G) counts how many vertices are in the smallest dominating set.

The Purpose of Dominant Set Viewer

This tool is designed to implement a dominating set solver while also giving you some great graph visualization options. You might wonder why we don't just use other libraries out there. Well, many of them can be heavy on resources or have extra features that we really don't need. Plus, some don't even have the features we do need!

Graph Visualization Made Easy

The visualizer used in Dominant Set Viewer is lightweight and can handle up to 3000 vertices connected in no time at all! Right now, it can render undirected graphs pretty well, but loops are still in the works for future updates.

Diverse Rendering Layouts

You'll love the different layouts this viewer offers:

• Random: Vertices placed randomly based on a grid.


• Circular: Displays all vertices equally distanced from the center.


• Maze: Renders nodes like a maze.


• Star: Shows vertices in a circular manner but with varied distances from the center.


• Planner: Aims to display planner graphs using the Fruchterman-Rheingold algorithm (FR), though it's not spot-on yet.

A Cross-Platform Solution

The best part? Dominant Set Viewer works smoothly across all major systems: Mac OS X, Windows, and Linux! If you're ready to dive into graph theory with this handy utility, check out more details and download it