feature: Graph Transitivity

sbromberger / LightGraphs.jl

An optimized graphs package for the Julia programming language

Other

670 stars 185 forks source link

feature: Graph Transitivity #1556

Open gerdm opened 3 years ago

gerdm commented 3 years ago

I propose to implement the "Graph Transitivity" coefficient for undirected graphs as presented in the book Complex Networks: Principles, Methods and Applications by Latora, V, et.al

Would this be a welcomed PR?

Latora, V., Nicosia, V., & Russo, G. (2017). Complex Networks: Principles, Methods and Applications. Cambridge: Cambridge University Press. doi:10.1017/9781316216002

sbromberger commented 3 years ago

It would be, but you'd need to produce a state of the art triangle counting algorithm as well. Consider the previous work done by @abhinavmehndiratta here.

sbromberger commented 3 years ago

@gerdm - just checking in. Are you still working on this?

gerdm commented 3 years ago

Hi @sbromberger,

Not at the moment since I'm working on other projects. However, if no-one is working on this issue once I'm available I'd be happy to retake it.