What Does Directed Harmonic Centrality Mean?
A directed graph represents links as arrows: a link from domain A to domain B creates an edge A → B. When calculating directed harmonic centrality, paths follow the arrows.
This means a node’s score concerns the nodes it can reach through outgoing paths. It is not simply an inbound-link count. Because directed reachability can be asymmetric, A may reach B even when B cannot reach A.
See the calculation steps and how Common Crawl defines its domain graph.
This answer describes the metric used by the HarmonicCentrality.org calculator. Common Crawl’s graph releases and methods can change; check the release shown with each score.