Skip to content

mariam-khaled/graph-centrality

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

88 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Graph Centrality

The project aims at applying algorithms based on graph theory to compute the centrality property for each node in the graph. It applies three centrality metrics on undirected connected graphs which are: degree, closeness and betweeness centralities. The project also provides visualisation of graphs. The used languages are C++ and Python.

Installation

NetworkX that is used by the visualisation tool requires Python 3.5, 3.6, or 3.7. If you do not already have a Python environment configured on your computer, please see the instructions for installing the full scientific Python stack

Use the package manager pip to install NetworkX:

pip install networkx

Optional Packages

Some packages like Matplotlib which provides flexible drawing of graphs provides additional functionality.

To install networkx and all optional packages, do:

pip install networkx[all]

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 85.9%
  • Python 14.1%