starFilters¶
- thema.multiverse.universe.utils.starFilters.component_count_filter(target_components: int) Callable[source]¶
Filter for graphs with specific number of connected components.
- Parameters:
target_components – Desired number of connected components
- Returns:
Filter function that returns 1 for matching graphs, 0 otherwise
Example
>>> filter_func = component_count_filter(4) >>> galaxy.collapse(filter_fn=filter_func)
- thema.multiverse.universe.utils.starFilters.component_count_range_filter(min_components: int, max_components: int) Callable[source]¶
Filter for graphs within component count range.
- Parameters:
min_components – Minimum number of components (inclusive)
max_components – Maximum number of components (inclusive)
- Returns:
Filter function that returns 1 for graphs in range, 0 otherwise
- thema.multiverse.universe.utils.starFilters.minimum_edges_filter(min_edges: int) Callable[source]¶
Filter for graphs with minimum number of edges.
- Parameters:
min_edges – Minimum number of edges required
- Returns:
Filter function that returns 1 for graphs meeting criteria, 0 otherwise
- thema.multiverse.universe.utils.starFilters.minimum_nodes_filter(min_nodes: int) Callable[source]¶
Filter for graphs with minimum number of nodes.
- Parameters:
min_nodes – Minimum number of nodes required
- Returns:
Filter function that returns 1 for graphs meeting criteria, 0 otherwise
- thema.multiverse.universe.utils.starFilters.minimum_unique_items_filter(min_unique_items: int) Callable[source]¶
Filter for graphs with minimum number of unique items across all nodes.
This filter counts the total number of unique data points present across all nodes in the Mapper graph, ensuring no double-counting of items that appear in multiple nodes.
- Parameters:
min_unique_items – Minimum number of unique items required
- Returns:
Filter function that returns 1 for graphs meeting criteria, 0 otherwise
Example
>>> filter_func = minimum_unique_items_filter(100) >>> galaxy.collapse(filter_fn=filter_func)