Free online tool

Network Centrality Calculator

Find well-connected nodes in a network. Compare degree, PageRank, betweenness and closeness scores, then download the results.

Works on your deviceNo account neededGraph JSON / SVG / PNG / CSVOpen workspace ↓

What does a node’s centrality score mean?

Different scores describe different structural roles. Degree counts connections; PageRank measures link-based prominence; betweenness measures shortest-path intermediaries; closeness summarizes hop distance. Choose a metric, read its weight and direction interpretation, and export ranked scores with the graph.

Make the connections.

On your device

Diagram title

Import graph JSON

Use directed: true or false, a nodes array with unique IDs, and edges with source and target IDs.

{
  "directed": false,
  "nodes": [
    {
      "id": "A",
      "label": "Village",
      "tags": [
        "home"
      ],
      "notes": "Starting point",
      "x": 140,
      "y": 200
    },
    {
      "id": "B",
      "label": "Forest",
      "tags": [
        "outdoors"
      ],
      "x": 380,
      "y": 90
    },
    {
      "id": "C",
      "label": "Bridge",
      "x": 380,
      "y": 310
    },
    {
      "id": "D",
      "label": "Castle",
      "x": 660,
      "y": 200
    },
    {
      "id": "E",
      "label": "Harbour",
      "x": 900,
      "y": 310
    }
  ],
  "edges": [
    {
      "id": "ab",
      "source": "A",
      "target": "B",
      "weight": 2
    },
    {
      "id": "ac",
      "source": "A",
      "target": "C",
      "weight": 6
    },
    {
      "id": "bc",
      "source": "B",
      "target": "C",
      "weight": 1
    },
    {
      "id": "bd",
      "source": "B",
      "target": "D",
      "weight": 7
    },
    {
      "id": "cd",
      "source": "C",
      "target": "D",
      "weight": 2
    },
    {
      "id": "de",
      "source": "D",
      "target": "E",
      "weight": 3
    }
  ]
}

Layout algorithmFlow directionNode spacing

Directed connectionsShow edge weights5 nodes · 6 connections

Edit nodes & connections ↓

Drag a node to move it. Drag blank space to pan.

Keyboard: focus a node and use arrow keys to move it; hold Shift for larger steps. Labels and notes are available in the editor below.

Compare node centrality

Centrality metricUse edge weights

Nodes & notes

Search nodes, notes or tagsChoose node (5 matches)

Deleting a node also deletes its connections. Undo restores both. Keep at least one node.

Connections

Three simple steps

How to use Network Centrality Calculator

Open a graph project or edit nodes and connections in the workspace.
Explore the graph and choose the relevant analysis or layout controls.
Export the diagram, data tables or an editable project.

Common questions

Good to know

Understand the result.
Keep the original.

Is this tool free, and are my files uploaded?

This tool is free with no account required. The work happens in your browser. Your input and files are not sent to a processing server.

What are the limits and details?

Centrality is contextual, not a universal importance measure. Calculations require a simple graph without parallel edges or self-loops. Weighted PageRank uses positive strengths; weighted betweenness uses positive distances. Closeness is unweighted and inbound for directed graphs.

Limits: 500 nodes, 2,000 edges and 500,000 project characters. Expensive operations run in a cancellable 30-second browser worker.

What does a node’s centrality score mean?

Make the connections.

Compare node centrality

Nodes & notes

Connections

How to use Network Centrality Calculator

Good to know

Related free tools

Graphviz DOT Playground

Dependency Map Builder

Decision Tree Builder