Adaptor class for complementary graph

[Peter Kovacs]

It would be nice to have an adaptor class to obtain the complementary graph of a simple, undirected graph.

[Peter Kovacs]

I think, the adaptor should not check if the original graph is simple or not, just leave out such edges that can be found in it.

[Alpar Juttner]

Replying to kpeter:

It would be nice to have an adaptor class to obtain the complementary graph of a simple, undirected graph.

Do you have any idea how to implement it?

A function to statically create a complementary graph seems to be an easier target.

[Peter Kovacs]

Replying to alpar:

It would be nice to have an adaptor class to obtain the complementary graph of a simple, undirected graph.

Do you have any idea how to implement it?

Such an adaptor class could be implemented as if it was a combination of FullGraph and FilterEdges using an ArcLookup solution for filtering the edges of the original graph. It wouldn't be so fast, but it would be convenient.

A function to statically create a complementary graph seems to be an easier target.

Adaptor classes are typically harder to implement and slower to use than creating another structure explicitly. However, they are more convenient, especially because they are dynamic. That's why I would prefer an adaptor class for this purpose.

(In fact, such an adpator class could be used easily to create an explict complementary graph using GraphCopy.)

[Smartmil8]

​http://smartmiltoys.com/kidkraft-dollhouse/