Groups
Groups
Sign in
Groups
Groups
networkx-discuss
Conversations
About
Send feedback
Help
Computing clustering coefficient for nodes in directed graph
322 views
Skip to first unread message
Ayushi Dalmia
unread,
Feb 18, 2017, 4:49:10 AM
2/18/17
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to networkx-discuss
Currently, networkx does not support computation of clustering coefficient of directed graphs.
Considering the definition given here:
https://en.wikipedia.org/wiki/Clustering_coefficient#Local_clustering_coefficient
, is it okay to convert the directed graph in an undirected one, compute the clustering coefficient for every node and then divide the coefficient by 2?
Thanks
Soroush Aali Bagi
unread,
Oct 31, 2018, 2:14:09 PM
10/31/18
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to networkx-discuss
No! It's more complicated than just adding on division! You can find the problem by making some small graph(for example 3 nodes).
Reply all
Reply to author
Forward
0 new messages