A :None:None:`dominating set` for an undirected graph G with vertex set V and edge set E is a subset D of V such that every vertex not in D is adjacent to at least one member of D. An :None:None:`edge dominating set` is a subset F of E such that every edge not in F is incident to an endpoint of at least one edge in F.
<Unimplemented 'target' '.. _dominating set: https://en.wikipedia.org/wiki/Dominating_set'>
<Unimplemented 'target' '.. _edge dominating set: https://en.wikipedia.org/wiki/Edge_dominating_set'>
Functions for finding node and edge dominating sets.
Functions for finding node and edge dominating sets.
A :None:None:`dominating set` for an undirected graph G with vertex set V and edge set E is a subset D of V such that every vertex not in D is adjacent to at least one member of D. An :None:None:`edge dominating set` is a subset F of E such that every edge not in F is incident to an endpoint of at least one edge in F.
<Unimplemented 'target' '.. _dominating set: https://en.wikipedia.org/wiki/Dominating_set'>
<Unimplemented 'target' '.. _edge dominating set: https://en.wikipedia.org/wiki/Edge_dominating_set'>
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them