API Reference
CircuiTree
A base class for implementing the Monte Carlo Tree Search (MCTS) algorithm for circuit topologies. |
|
Compute the UCB score for a node in the search graph. |
Built-in Grammars
A Grammar class for pairwise interaction networks. |
|
A convenience subclass of CircuiTree that uses SimpleNetworkGrammar by default. |
|
(Experimental) A grammar class for the design space of dimerizing TF networks. |
|
A convenience subclass of CircuiTree that uses DimersGrammar by default. |
Low-level CircuitGrammar API
Abstract class for Grammars. |
Visualisation
Converts rgb colors to hex |
|
Returns the depth and xy coordinates of each node in the search graph when visualized based on complexity. |
|
Plot an N-component network as a circular diagram. |
Utility functions and classes
Given an iterable of non-empty sets, merges any sets that have non-empty intersection |
|
Event object that also provides a context manager. |
|
A simple thread-safe counter. |