Control Flow Plots - Find All Linearly Independent Paths

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

Thank!