Multiple Choice Question for Data Science:

The graph expansion algorithm that involves building a complete graph over the terminal $($leaf$)$ nodes is $\_\_\_\_\_\_.$

cost$-$based backwards expansion

bidirectional expansion

threshold$-$based expansion

backward expansion