## Mercurial > repos > shellac > sam_consensus_v3

### view env/lib/python3.9/site-packages/networkx/classes/filters.py @ 0:4f3585e2f14b draft default tip

Find changesets by keywords (author, files, the commit message), revision
number or hash, or revset expression.

"planemo upload commit 60cee0fc7c0cda8592644e1aad72851dec82c959"

author | shellac |
---|---|

date | Mon, 22 Mar 2021 18:12:50 +0000 |

parents | |

children |

line wrap: on

line source

"""Filter factories to hide or show sets of nodes and edges. These filters return the function used when creating `SubGraph`. """ __all__ = [ "no_filter", "hide_nodes", "hide_edges", "hide_multiedges", "hide_diedges", "hide_multidiedges", "show_nodes", "show_edges", "show_multiedges", "show_diedges", "show_multidiedges", ] def no_filter(*items): return True def hide_nodes(nodes): nodes = set(nodes) return lambda node: node not in nodes def hide_diedges(edges): edges = {(u, v) for u, v in edges} return lambda u, v: (u, v) not in edges def hide_edges(edges): alledges = set(edges) | {(v, u) for (u, v) in edges} return lambda u, v: (u, v) not in alledges def hide_multidiedges(edges): edges = {(u, v, k) for u, v, k in edges} return lambda u, v, k: (u, v, k) not in edges def hide_multiedges(edges): alledges = set(edges) | {(v, u, k) for (u, v, k) in edges} return lambda u, v, k: (u, v, k) not in alledges # write show_nodes as a class to make SubGraph pickleable class show_nodes: def __init__(self, nodes): self.nodes = set(nodes) def __call__(self, node): return node in self.nodes def show_diedges(edges): edges = {(u, v) for u, v in edges} return lambda u, v: (u, v) in edges def show_edges(edges): alledges = set(edges) | {(v, u) for (u, v) in edges} return lambda u, v: (u, v) in alledges def show_multidiedges(edges): edges = {(u, v, k) for u, v, k in edges} return lambda u, v, k: (u, v, k) in edges def show_multiedges(edges): alledges = set(edges) | {(v, u, k) for (u, v, k) in edges} return lambda u, v, k: (u, v, k) in alledges