_is_connected_by_alternating_path(G, v, matched_edges, unmatched_edges, targets)
An alternating path is a path in which every other edge is in the specified maximum matching (and the remaining edges in the path are not in the matching). An alternating path may have matched edges in the even positions or in the odd positions, as long as the edges alternate between 'matched' and 'unmatched'.
:None:None:`G` is an undirected bipartite NetworkX graph.
:None:None:`v` is a vertex in :None:None:`G`.
:None:None:`matched_edges` is a set of edges present in a maximum matching in :None:None:`G`.
:None:None:`unmatched_edges` is a set of edges not present in a maximum matching in :None:None:`G`.
:None:None:`targets` is a set of vertices.
Returns True if and only if the vertex :None:None:`v` is connected to one of the target vertices by an alternating path in :None:None:`G`.
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