GetTriadsAll

GetTriadsAll(SampleNodes=- 1)

A graph method that computes the number of closed and open triads for every node. Considers the graph as undirected.

Parameters:

• (optional) SampleNodes: integer

  If equal to -1, then compute triads over all the nodes. Otherwise, compute triads only for a random sample of SampleNodes nodes, which is useful for approximate but quick computations.

Return value:

• list: [int, int, int]

  The list contains three elements: the first two elements are the number of closed triads and the third element is the number of open triads in the graph.

The following example shows how to compute the number of open and closed triads for nodes in TNGraph, TUNGraph, and TNEANet:

import snap

Graph = snap.GenRndGnm(snap.TNGraph, 100, 1000)
result = Graph.GetTriadsAll()
print("closed triads", result[0])
print("open triads", result[2])

Graph = snap.GenRndGnm(snap.TUNGraph, 100, 1000)
result = Graph.GetTriadsAll()
print("closed triads", result[0])
print("open triads", result[2])

Graph = snap.GenRndGnm(snap.TNEANet, 100, 1000)
result = Graph.GetTriadsAll()
print("closed triads", result[0])
print("open triads", result[2])