Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Brandes' algorithm

In network theory, Brandes' algorithm is an algorithm for calculating the betweenness centrality of vertices in a graph. The algorithm was first published in 2001 by Ulrik Brandes. Betweenness centrality, along with other measures of centrality, is an important measure in many real-world networks, such as social networks and computer networks.

Algorithm, Definitions & Pseudocode

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Brandes' algorithm. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Algorithm

Breadth-first searchSet-builder notationStack data structureBackpropagation
4 related topics

Definitions

Connected graph
1 related topics

Pseudocode

Pseudocode
1 related topics

Running time

Space complexity
1 related topics

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Class
Centrality Network theory
Data structure
Connected graph
Worst-case performance
O ( | V | | E | ) {\displaystyle O(|V||E|)} (unweighted) O ( | V | | E | + | V | 2 log ⁡ | V | ) {\displaystyle O(|V||E|+|V|^{2}\log |V|)} (weighted)
Worst-case space complexity
O ( | V | + | E | ) {\displaystyle O(|V|+|E|)}

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Definitions

Algorithm

Pseudocode

Running time

Variants

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Brandes' algorithm

Nodes24
Edges23
Triples9
Avg. degree1.92
Density0.083333
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Brandes' algorithm

Top relations

related to Algorithm · 2
Brandes' algorithm → Brandes, For
related to Pseudocode · 2
Brandes' algorithm → Brandes, The
Class · 1
Brandes' algorithm → Centrality Network theory
Data structure · 1
Brandes' algorithm → Connected graph
Worst-case performance · 1
Brandes' algorithm → O ( | V | | E | ) {\displaystyle O(|V||E|)} (unweighted) O ( | V | | E | + | V | 2 log ⁡ | V | ) {\displaystyle O(|V||E|+|V|^{2}\log |V|)} (weighted)
Worst-case space complexity · 1
Brandes' algorithm → O ( | V | + | E | ) {\displaystyle O(|V|+|E|)}
is a · 1
Brandes' algorithm → algorithm for calculating the betweenness centrality of vertices in a graph

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

displaystyle centrality vertex betweenness algorithm graph shortest vertices sigma sum delta breadth-first search brandes' path time backpropagation st number paths

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Brandes' algorithmClassCentrality Network theory1.00infobox
Brandes' algorithmData structureConnected graph1.00infobox
Brandes' algorithmWorst-case performanceO ( | V | | E | ) {\displaystyle O(|V||E|)} (unweighted) O ( | V | | E | + | V | 2 log ⁡ | V | ) {\displaystyle O(|V||E|+|V|^{2}\log |V|)} (weighted)1.00infobox
Brandes' algorithmWorst-case space complexityO ( | V | + | E | ) {\displaystyle O(|V|+|E|)}1.00infobox
Brandes' algorithmis aalgorithm for calculating the betweenness centrality of vertices in a graph0.90text
Brandes' algorithmrelated to AlgorithmBrandes0.60section
Brandes' algorithmrelated to AlgorithmFor0.60section
Brandes' algorithmrelated to PseudocodeThe0.60section
Brandes' algorithmrelated to PseudocodeBrandes0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.