一道有关Graph的面试题# JobHunting - 待字闺中e*62010-11-08 08:111 楼给一个undirected graph,如何有效率的找出所有最大的full-meshed subgraph。full-meshed就是全连通的意思。比如:假设a,b,c,d四个节点中a,b,c是full-meshed。那么a,b,c中任意两个之间都是connected的。且a,b,c,d不是full-meshed,否则就要把d加入进来
h*62010-11-08 08:112 楼这是“Listing all maximal cliques”的问题,面试考这个有点变态了。可以使用Bron–Kerbosch algorithmhttp://en.wikipedia.org/wiki/Bron-Kerbosch_algorithm
e*62010-11-08 08:113 楼膜拜大神。。。我注意你很久了,请问如何提高到这么厉害的?。。【在 h**6 的大作中提到】: 这是“Listing all maximal cliques”的问题,面试考这个有点变态了。可以使用: Bron–Kerbosch algorithm: http://en.wikipedia.org/wiki/Bron-Kerbosch_algorithm
a*c2010-11-08 08:115 楼I hate graph problems even though they somehow relate to many networkingproblems which is supposed to be my field of research.