I have learned various theoretical testing methods and test case generations through university's quality assurance course.
One of the techniques that interest me is Graph Coverage which is a theory to visualize each operation (e.g. click a button) as a node and the transition as edge (DAG).
Prime Path Coverage is used to create high coverage while minimizing the number of test cases. This is very useful for functional testing.
For example, if we are to test a web application, the operations that can be done to use the application can be represented as a graph, and we can find the prime paths in the graph in order to derive test cases. We can always use equivalence partitioning to feed in different inputs to the paths to test for correct outputs. The combination of graph coverage and equivalence partitioning can help QA to find the minimum number of test cases that cover the most.
While this method sounds pretty functional on paper, how practical is this technique and how often this is used in the industry?