Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
boost 图形库用于有向图的默认 Fruchterman-Reingold 算法需要 O(n^2) 时间，是否有任何 O(n log n) 布局算法的实现，例如 Barnes-Hut for Boost Graph library？