LightGraphs.jl icon indicating copy to clipboard operation
LightGraphs.jl copied to clipboard

Published 20 hours ago • verified publisher icon sbromberger

feature: Graph Transitivity

Open gerdm opened this issue 3 years ago • 3 comments

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

image

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

gerdm avatar Apr 03 '21 09:04 gerdm

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 avatar Apr 10 '21 16:04 sbromberger

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

sbromberger avatar Jun 04 '21 11:06 sbromberger

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.

gerdm avatar Jun 06 '21 10:06 gerdm