Implement wedge count

[LibraChris]

Description The Wedge Count algorithm, like the Triangle Count algorithm, is a graph analysis technique used to identify certain structural patterns within a graph. In this case, it focuses on detecting wedges. A wedge (sometimes called Triad) is a collection of three nodes in the graph where two of these nodes share a direct edge or relationship, and the third node serves as a common neighbour to the other two. This concept is often referred to as a "2-clique" in graph theory.

Pointers The clustering coefficient makes use of triangles, which might give some ideas about the implementation.

References

• http://konect.cc/statistics/twostars/

[lamg]

I'm working on this 🦾

[DoganCK]

https://arxiv.org/pdf/1603.05843.pdf

[LibraChris]

Another resource:

http://dx.doi.org/10.1137/1.9781611972832.2