is_edge_cover(G, cover)
Given a set of edges, whether it is an edge covering can be decided if we just check whether all nodes of the graph has an edge from the set, incident on it.
An edge cover of a graph is a set of edges such that every node of the graph is incident to at least one edge of the set.
Whether the set of edges is a valid edge cover of the graph.
Decides whether a set of edges is a valid edge cover of the graph.
>>> G = nx.Graph([(0, 1), (0, 2), (0, 3), (1, 2), (1, 3)])See :
... cover = {(2, 1), (3, 0)}
... nx.is_edge_cover(G, cover) True
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.covering.is_edge_cover
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