GraphQuery#

class scikitplot.corpus.GraphQuery(seeds=(), max_seed_nodes=32, max_hops=2, max_neighbors_per_node=64, max_total_nodes=512, max_total_edges=2048, allowed_relation_types=None, deadline_seconds=None, max_evidence=None, min_trust=None)[source]#

A bounded traversal request.

Parameters:

seedstuple of str

Starting node_id values.

max_seed_nodesint, optional

max_hopsint, optional

max_neighbors_per_nodeint, optional

max_total_nodesint, optional

max_total_edgesint, optional

allowed_relation_typestuple of RelationType or None, optional

None admits every relation.

deadline_secondsfloat or None, optional

max_evidenceint or None, optional

Evidence budget: cap on returned nodes carrying payload.

min_trustEdgeTrust or None, optional

Exclude edges below this tier.

Parameters:

• seeds (tuple[str, ...])

• max_seed_nodes (int)

• max_hops (int)

• max_neighbors_per_node (int)

• max_total_nodes (int)

• max_total_edges (int)

• allowed_relation_types (tuple[RelationType, ...] | None)

• deadline_seconds (float | None)

• max_evidence (int | None)

• min_trust (EdgeTrust | None)

Notes

Developer. All eight §20 budgets are present with conservative defaults, because an unbounded traversal over a derived graph is unbounded work. allowed_relation_types doubles as the relation-constrained search mode, which is why only BFS is implemented: relation-constrained traversal is BFS with this field set, not a separate algorithm.

allowed_relation_types: tuple[RelationType, ...] | None = None#

deadline_seconds: float | None = None#

max_evidence: int | None = None#

max_hops: int = 2#

max_neighbors_per_node: int = 64#

max_seed_nodes: int = 32#

max_total_edges: int = 2048#

max_total_nodes: int = 512#

min_trust: EdgeTrust | None = None#

seeds: tuple[str, ...] = ()#