Ranked Paige-Tarjan

ranked_split(current_partition, B_qblock, max_rank)

Split the given partition using the block B_qblock as splitter, then use Ranked Paige-Tarjan’s algorithm on the resulting partition.

Parameters

• current_partition (List[_QBlock]) – The current partition as a list of bispy.utilities.graph_entities._QBlock.

• B_qblock (_QBlock) – The block to be used as splitter.

• max_rank (int) – The maximum rank which may be found in the graph.

Return type

List[Tuple[_Vertex]]

Returns

The output of Ranked Paige-Tarjan’s algorithm as a list of tuples of vertexes.

pta(x_partition, q_partition, compound_xblocks)

Apply the Ranked Paige-Tarjan’s algorithm to obtain the RSCP/maximum bisimulation of the given q_partition.

Parameters

• x_partition (List[_XBlock]) – The partition \(X\).

• q_partition (List[_QBlock]) – The partition \(Q\).

• compound_xblocks (RankedCompoundXBlocksContainer) – List of compound blocks of \(X\) (namely blocks that contain more than one block of the partition \(Q\)).

Return type

List[Tuple[_Vertex]]