2014年2月18日
Coursera-Algotithms学习
摘要： Week1 Job Interview QuestionSocial network connectivity.Given a social network containingNmembers and a log file containingMtimestamps at which times pairs of members formed friendships, design an algorithm to determine the earliest time at which all members are connected (i.e., every member is a fr 阅读全文
posted @ 2014-02-18 22:45 理想空间 阅读(1664) 评论(0) 推荐(0)