search

snafu.search.cbdfs(g, td)

Coverage-biased depth-first search on a graph.

Parameters:

• g (networkx.Graph) – The input graph.

• td (object) – Parameters including trim and start_node.

Returns:

Sequence of visited node indices.

Return type:

list

snafu.search.nodeDegreeSearch(g, td)

Biased random walk where selection favors high-degree nodes.

Parameters:

• g (networkx.Graph) – The input graph.

• td (object) – Includes trim (float or int) and start_node (str or tuple).

Returns:

Sequence of visited node indices.

Return type:

list

snafu.search.spreadingActivationSearch(g, td, decay)

Perform spreading activation search on a graph.

Parameters:

• g (networkx.Graph) – The graph to search.

• td (object) – Configuration object with search parameters like trim, start_node, and priming.

Returns:

Ordered list of activated node indices.

Return type:

list