search

jhu-graphstat / LSGMcode

This directory contains the codes for reproducing the figures in the paper Spectral Clustering for Divide-and-Conquer Graph Matching
0 stars 1 forks source link

Could be a problem if there is exactly one seed #12

Open dpmcsuss opened 9 years ago

dpmcsuss commented 9 years ago

The way we are supporting seed lists now, we check numel(seeds)==1 (see here for example) and if it is then we set seeds=1:seeds;