Adaptive test case sorting method based on greedy algorithm and clustering analysis
A test case, greedy algorithm technology, applied in software testing/debugging, computing, computer parts, etc., can solve the problem of low efficiency, reduce test costs, reduce sorting speed and time, and improve sorting efficiency.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0036] In order to understand more clearly the technical content of a method for sorting adaptive test cases based on greedy algorithm and cluster analysis of the present invention, the present invention will be further described below in conjunction with the accompanying drawings and specific implementation cases. It should be pointed out that the described The implementation examples given are intended to facilitate the understanding of the present invention without any limiting requirements.
[0037] The flow chart of a kind of self-adaptive test case sorting method based on greedy algorithm and cluster analysis that the present invention provides is as shown in Figure 1, and the first step reads original test case, calculates the Manhattan distance matrix of original test case; According to the Manhattan distance matrix, the original test cases are divided into k (5% of the total number of test cases) clusters by using the improved K center point clustering method for the o...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com