i. Black-box methods based on the nature of the relationships (links) among the program objects (nodes), test cases are designed to traverse the entire graph

ii. Transaction flow testing – nodes represent steps in some transaction and links represent logical connections between steps that need to be validated

iii. Finite state modeling – nodes represent user observable states of the software and links represent transitions between states

iv. Data flow modeling – nodes are data objects and links are transformations from one data object to another

v. Timing modeling – nodes are program objects and links are sequential connections between these objects, link weights are required execution times.

Steps in graph testing:

i. Build a graph model.

ii. Identify the test requirements.

iii. Select test paths to cover those requirements.

Derive test data so that those test paths can be executed.