Dominant set viewer A dominating set solver and graph visualizer
Download

Dominant set viewer Ranking & Summary

Dominant set viewer Tags

view viewer graph visualization

Dominant set viewer Description

Dominant set viewer is a free and open-source utility that uses constraint satisfaction techniques to solve the dominating set problem.From Wikipedia: In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at least one member of D by some edge. The domination number γ(G) is the number of vertices in a smallest dominating set for G.Dominant set viewer is aimed to implement a dominating set solver and provide graph visualization as well. The reason of not using existing libraries for visualizing graphs is that most of them are resource greedy and may contain extra features which are not required, or worse may not contain a required feature.Therefore, the graph visualization utility used in this project is light weight and able to render up to 3000 vertices linked to each other within a blink. The graph visualizer can render undirected graphs at the moment, loops are not yet implemented. However, will add these features soon. Dominant set viewer has the following rendering layouts: · Random : which is based on a grid where vertices are placed randomly.· Circular : which displays all of the vertices distant equally from a center point.· Maze : which render the nodes as a maze· Star : which displays vertices in a circular way but not equally distant from the center.· Planner : this layout is expected to show planner graph as per the Fruchterman-Rheingold algorithm (FR) however, it is not accurate at the moment. Dominant set viewer is cross-platform and it works on Mac OS X, Windows and Linux.

Dominant set viewer Related Software