komed3 / mw-shortest-path

MediaWiki Extension for calculating the shortest route between two articles

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

MediaWiki Extension: ShortestWikiPath

The MediaWiki Extension allows you to search for the shortest connection between two articles of the Wiki project. It uses the Dijkstra algorithm.

Tested with MediaWiki 1.28, 1.29, 1.30, 1.31

Introduction

To find the shortest route between all the links in the wiki project, the extension uses the Dijkstra algorithm. To do this, only start and target articles must be entered in a form. You can also activate the reverse search, in which case the algorithm will also try to link from the target to the start article.

The algorithm of Dijkstra calculates a shortest route between the given start node and all other nodes. For this extension, all edges are weighted equally, since links are equivalent.

Installation

Download all necessary files, unzip there and place it in the ShortestWikiPath folder in the extensions/ directory of your MediaWiki installation.

In the next step, add the following to your LocalSettings.php:

wfLoadExtension( 'ShortestWikiPath' );

Now you can check via Special:Version whether the extension was installed successfully.

Supported languages

  • English
  • German (Deutsch)

License

MIT

About

MediaWiki Extension for calculating the shortest route between two articles

License:MIT License


Languages

Language:PHP 80.2%Language:CSS 19.8%