I have a large, connected, sparse graph in adjacency-list form. I would like to find two vertices that are as far apart as possible, that is, the I have a large, connected, sparse graph in adja
阅读背景：
找到（稀疏）图的直径的好算法？
来源：互联网
分享到：
