YupingLu / biclique

Maximal Biclique Enumeration in Bipartite Graphs
https://github.com/YupingLu/biclique
GNU General Public License v2.0
21 stars 10 forks source link

clarify recursive callee in biclique_find_improve #11

Open kortschak opened 3 years ago

kortschak commented 3 years ago

In biclique_find_improve the recursive call is made to biclique_find_basic. The algorithm as written doesn't distinguish between iMBEA and MBEA explicitly in terms of what child problem approach would be used in the recursion, but I'd probably read it as calling the improved version for child problems.

Is the current implementation calling the correct function?