Graph Coverage Web Application

Graph Information
Please enter your graph edges in the text box below. Put each edge in one line. Enter edges as pairs of nodes, separated by spaces.(e.g.: 1 3)
Enter initial nodes below (can be more than one), separated by spaces. If the text box below is empty, the first node in the left box will be the initial node.

 
Enter final nodes below (can be more than one), separated by spaces.

 
Test Requirements:        
Test Paths: Algorithm 1: Slower, more test paths, shorter test paths        
Algorithm 2: Faster, fewer test paths, longer test paths        
Algorithm 1 is our original, not particularly clever, algorithm to find test paths from graph coverage test requirements. In our 2012 ICST paper, "Better Algorithms to Minimize the Cost of Test Paths," we described an algorithm that combines test requirements to produce fewer, but longer test paths (algorithm 2). Users can evaluate the tradeoffs between more but shorter test paths and fewer but longer test paths and choose the appropriate algorithm.
Other Tools:      
Share Graph:  

Companion software
to Introduction to Software Testing, Ammann and Offutt.
Implementation by Wuzhi Xu, Nan Li, Lin Deng, and Scott Brown.
© 2007-2017, all rights reserved.
Last update: 22-Feb-2017