from https://en.wikipedia.org/wiki/Clustering_coefficient :
The local clustering coefficient {\displaystyle C{i}} C{i} for a vertex {\displaystyle v{i}} v{i} is then given by the proportion of links between the vertices within its neighbourhood divided by the number of links that could possibly exist between them. For a directed graph, {\displaystyle e{ij}} e{ij} is distinct from {\displaystyle e{ji}} e{{ji}}, and therefore for each neighbourhood {\displaystyle N{i}} N{i} there are {\displaystyle k{i}(k{i}-1)} k{i}(k{i}-1) links that could exist among the vertices within the neighbourhood ( {\displaystyle k{i}} k{i} is the number of neighbours of a vertex).
For node “Michael”, 3 out of 6 possible edges connecting all vertices in their neighbourhood actually exist, so the coefficient should be 0,5 instead of 0,3
I have the impression that
as illustrated on https://neo4j.com/docs/graph-algorithms/current/algorithms/triangle-counting-clustering-coefficient/ (table 6.25) returns the wrong results:
from https://en.wikipedia.org/wiki/Clustering_coefficient : The local clustering coefficient {\displaystyle C{i}} C{i} for a vertex {\displaystyle v{i}} v{i} is then given by the proportion of links between the vertices within its neighbourhood divided by the number of links that could possibly exist between them. For a directed graph, {\displaystyle e{ij}} e{ij} is distinct from {\displaystyle e{ji}} e{{ji}}, and therefore for each neighbourhood {\displaystyle N{i}} N{i} there are {\displaystyle k{i}(k{i}-1)} k{i}(k{i}-1) links that could exist among the vertices within the neighbourhood ( {\displaystyle k{i}} k{i} is the number of neighbours of a vertex).
For node “Michael”, 3 out of 6 possible edges connecting all vertices in their neighbourhood actually exist, so the coefficient should be 0,5 instead of 0,3