Evan ProdromouSo, I might be able to get away with doing a breadth-first search through the graph, and do the 2-node paths first, then the 3-node ones, and so on. And once one direction has an overwhelming number of paths, I could just bail out and say, hey, there probably aren't enough very long paths here to make a difference, and it's not worth trying to find them.
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.