Graph-Centrality

What the project does?

the project is about how to compute centrality property in graph data strucure and make visualization for graph nodes .the project is split into three parts.

• Degree Centrality

• Closeness centrality

• Betweenness Centrality

Why the project is useful?

the importance of this project is to make scores for each node so we can get the most importance nodes which is very usefull in many applications

How users can get started with the project?

we have text file as input which has number of nodes and edges and each node connection with specfic weight.so user can modify file to get any inputs and choose which process he want to do (Degree ,Closeness,Betweenness,Exit) so he get the results .

algorizms or tools used in the projects?

• dijkstra shortest path algorithm using priority queue

• dijkstra shortest path algorithm using priority queue for specfic for Betweenness Centrality to have more than parent

• map data structure

• recursive functon

• file sysytem mangement

Who maintains and contributes to the project

• عبدالله شاكر عبدالرحمن

• عبدالله خيري اسماعيل

• عبدالرحمن ممدوح خليل