search

ldbc / sigmod2014-contest-graphblas

GraphBLAS solution for the 2014 SIGMOD Programming Contest
Apache License 2.0
3 stars 1 forks source link

Q1 optimization: run bidirectional BFS #22

Closed szarnyasg closed 4 years ago

szarnyasg commented 4 years ago

A possible optimization would be to implement bidirectional search using two concurrent BFSs. However, implementing this would require a 'fork' of the LAGraph-based bfs/bfs_pushpull algorithm so it's a nontrivial amount of work.

szarnyasg commented 4 years ago

Idea: we could leverage both the normal and bitwise MSBFS implementations with two source vertices.

cc @sandordavid1124

szarnyasg commented 4 years ago

Idea: we could leverage both the normal and bitwise MSBFS implementations with two source vertices.

I discussed this @marci543 . The bitwise representation will not work because we need to count #interactions. However, adding push/pull is easy (we just need to get the heuristics right).