Research and implementation of ClearQuest shortest state transfer path algorithm

CQ state Transition Model Overview:

ClearQuest is an industry-level defect tracking and change management tool that defines and implements a range of concepts and mechanisms to effectively implement defect tracking and change management. ClearQuest The RecordType and Statetransition models are the two most important concepts in the ClearQuest bug limit tracking and change management model. The RecordType mechanism enables users to define the entities they want to track and manage, while combining the statetransition Model defined on the corresponding RecordType, users can use ClearQuest to manage and track this RecordType Entity at a certain point in time, this can reduce the user management defects and changes in the mental burden, effective control and management of defects and changes.

ClearQuest also provides several sets of APIs, such as the BASIC API and the PERL API, which make it easy for users to customize RecordType and write hooks for corresponding recordtype. In this process, users often need to calculate the sequence of actions (action) to be performed from a starting state to a signaled state based on the RecordType Transition Model.

The state transition matrix defines the declaration cycle for a recordtype change request. The following constraint rules are in the ClearQuest state transition model:

Requires that there is only one action (action) in both neighboring states.

ClearQuest requires no orphaned state in the state transition model, that is, no state is allowed, no Action can reach this state.

Any recordtype state transition model satisfies the above two constraint rules.

Figure 1 is a recordtype state transition model in a ClearQuest. In ClearQuest, the state transition model is generally used to store the state transition matrix, as shown in this figure. In this state transition matrix, we can see that eight different states form a 8*8 matrix, the column header represents the source state, the wardrobe represents the target State, and the elements in the matrix represent the Action to be performed from the source state to the target State. If two states can be transferred, the intersection element of the two states is non-null, otherwise null.

Figure 1. A state transition matrix of some kind of recordtype

Fig. 2 is a state transition graph corresponding to the state transition matrix above, from which we can see that this RecordType state transition model conforms to the constraint rules of the ClearQuest state transition model. That is, there is no orphaned state; there is only one Action between each pair of source and destination states.

Figure 2. State transition Diagram