Efficient implementation of bfs algorithm for a subgraph of a complete graph

Asked Apr 16 '14 at 22:44

Active Apr 23 '14 at 05:39

Viewed 316 times

I'm stuck in the following problem:

I have the adjacency lists of a subgraph which is part of a complete graph. What I want to do is to apply bfs algorithm to the complement of the given subgraph. So, to do that, I need the succesors of each vertex in the complement.

What is the most efficient way to do that? The graph has a huge number of vertices and edges (~1 000 000).

edited Apr 23 '14 at 05:39

Luigi

4,129
6
37
57

asked Apr 16 '14 at 22:44

svecax

1

Is it [this problem](http://stackoverflow.com/q/23030181/1127872) again? – voidengine Apr 17 '14 at 00:17
1

If you want to perform seaching in the complement, why not generating the successors in the complement on the fly by following every non-edge? – Codor Apr 17 '14 at 06:21
Problem solved. It worked as Codor said. Thanks! – svecax Apr 18 '14 at 05:17

Efficient implementation of bfs algorithm for a subgraph of a complete graph

0 Answers0