Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Improve formatting and fix a typo in README.md #13

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Improve formatting and fix a typo in README.md #13

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ A weighted graph G. See graph.txt file as a sample for the input graph format. I
u,v,w

Above line specifies that there is an edge between node u and v with positive weight w.
The lowest id should be zero and the nodes id's increase. If you want to used this code for an unweighted graph,
The lowest id should be zero and the nodes id's increase. If you want to use this code for an unweighted graph,
simply set the weight equal to one on each input line.

## Output
Expand All @@ -21,13 +21,13 @@ This code runs Girvan-Newman algorithm and returns a list of detected communitie

For running the python code, you need to install Python 3 and NetworkX package on your machine. Check link below for more details:

https://networkx.github.io/documentation/latest/install.html
https://networkx.github.io/documentation/latest/install.html

## Girvan-Newman Algorithm Description

You can find the details for how Girvan-Newman algorithm works from the following link:

http://www.kazemjahanbakhsh.com/codes/cmty.html
http://www.kazemjahanbakhsh.com/codes/cmty.html

## How to run Python script

Expand Down