Wikipedia Network Graph

This project presents visualizations of the network structure of Wikipedia articles given a starting article.

The data was gathered using the English Wikipedia API. Each network is generated with a depth of 2 links and the top 30 links from each article. You can hover over each node to see the article title.

The Louvain Modularity Algorithm was used to cluster the nodes into communities. The algorithm optimizes for modularity, which is a measure of the strength of division of a network into modules or communities. You can read more about it here. The color of each node determines the community it belongs to.

Alan Turing

Machine Learning

Black Hole

The Butterfly Effect

Leonardo da Vinci

Try it out yourself!

Enter the name of an article to see the network of the article and its top 30 links. The previous network graphs used the Louvain Modularity Algorithm from the python community package. The current implementation uses the npm graphology package.

If you get an unexpected graph, try capitalizing the article name appropriately. For example, "iphone" should be "iPhone".