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.

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

network diameter #10

Open
mjafarpour87 opened this issue Mar 7, 2023 · 2 comments
Open

network diameter #10

mjafarpour87 opened this issue Mar 7, 2023 · 2 comments
Assignees
Labels
enhancement New feature or request

Comments

@mjafarpour87
Copy link
Collaborator

networkx does not compute the network diameter for directed graphs/networks. one way to calculate diameter is to use the concept to longest path length. I suggest you use longest path length for diameter calculation in case of directed graphs. check the link below for more info:
https://groups.google.com/g/networkx-discuss/c/srfJN13jYco?pli=1

@EhsanBitaraf
Copy link
Owner

I did not understand the calculation method from the link you gave
please explain more

@EhsanBitaraf EhsanBitaraf added the enhancement New feature or request label Mar 14, 2023
@mjafarpour87
Copy link
Collaborator Author

Intuitively, to find the diameter of a graph, first find the shortest path between each pair of vertices. The greatest length of any of these paths is the diameter of the graph. In other words, you should calculate the longest path between each node pairs in the network.

@EhsanBitaraf EhsanBitaraf self-assigned this Jun 10, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

2 participants