Fortunately it is easy to implement this functionality yourself (at least for undirected graphs).
For the case of an undirected simple graph, there are four types of triads: with 0, 1, 2, or 3 edges.
The 0 and 1 case can be reduced to the 3 and 2 cases, respectively, by replacing every edge with a non-edge and vice versa.
The number of 2-edge triads is half the sum of the non-diagonal elements in A^2 where A is the adjacency matrix.
The number of 3-edge triads is 1/6 of the sum of the diagonal elements (trace) of A^3.