Finding total number of triangles using networkx

Question

I want to count the total number of triangles in a graph using networkx python package.

I have tried the following:

import networkx as nx
g = ## some graph
t = nx.triangles(g)

However, nx.triangles() returns a dictionary denoting the number of triangles each vertex belongs to.

I cannot find any direct relationship between the total number of triangles and the values in the dictionary returned. And I could not find a method in networkx that directly returns the total number of nodes as a single integer value.

Is there any relationship between the dictionary mentioned above and the total number of triangles? If not, how can I compute the total number of triangles using networkx?

Joel · Accepted Answer · 2020-02-27 04:59:58Z

3

sum(D.values()) sums up the values in a dictionary. Each triangle is counted as a triangle for each of the three nodes. Thus the sum of the values should be 3 times the number of triangles.

answered Feb 27, 2020 at 4:59

Joel

24k9 gold badges79 silver badges104 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Ulf Aslak · Accepted Answer · 2020-11-10 19:03:22Z

3

If G is your network then it's:

number_of_triangles = sum(nx.triangles(G).values()) / 3

answered Nov 10, 2020 at 19:03

Ulf Aslak

8,6784 gold badges40 silver badges59 bronze badges

Collectives™ on Stack Overflow

Finding total number of triangles using networkx

2 Answers 2

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related