I want to find all the possible linearly independent paths in a CFG. As per my limited knowledge of algorithms, a CFG would essentially be a directed graph containing cycles. The formula for cyclomatic complexity is simple. I was wondering if there is way to get all the linearly independent paths from the start to the end node (given by the cyclomatic complexity)
Thanks!