|
关注：1
2013-05-23 12:21
求翻译：greedy algorithms look for the best node in some measurement while graph growing algorithms look for a node whose resulting sub-graph grows in a certain way。是什么意思？ 待解决
 悬赏分：1
- 离问题结束还有
greedy algorithms look for the best node in some measurement while graph growing algorithms look for a node whose resulting sub-graph grows in a certain way。
问题补充： |
湖北省互联网违法和不良信息举报平台 | 网上有害信息举报专区 | 电信诈骗举报专区 | 涉历史虚无主义有害信息举报专区 | 涉企侵权举报专区
