Adding broadcasting algorithms and related graph generators #6824
Replies: 3 comments
-
Can you briefly explain how the broadcast time differs from the eccentricity of a network? And it's fine if it is the same -- but I want to understand the question that "broadcasting" is addressing in relation to other known problems. For a recent addition, look at #6633 and the |
Beta Was this translation helpful? Give feedback.
-
Broadcasting is the time it takes to reach all the nodes in the graph, you are right that there are many similarities with the eccentricity of a network, especially in less connected graphs. However, they are still quite different. Just as a simple example, in a fully connected graph with n vertices, the eccentricity is always 1. However, the broadcast of the same graph is: I feel like it's possible we could have enough material to create a new module, we will get back to you after discussing about design ideas in more detail. |
Beta Was this translation helpful? Give feedback.
-
This was added in #6928 so closing the discussion, thanks all! |
Beta Was this translation helpful? Give feedback.
-
Hello NetworkX developers,
I had the pleasure of meeting some of you at Scipy 2023 in Austin, Texas, where I first brought this idea up.
I wanted to propose a project for two undergraduate students (myself included).
The idea is to add new algorithms in the field of broadcasting to your already existing suite of algorithms.
Please find a copy of my proposal below.
https://docs.google.com/document/d/15vYHZeLh7x6BWRDYSXd05aOR1Nx0tIzyKvHyhDbpKg8/edit
I wanted to start a discussion about the steps towards adding a new algorithm to networkx, we can discuss about how to name APIs and other related topics/concerns on your end.
Could you point us to some relatively new algorithms that have been added? it would be nice to have as a reference for good practices.
Beta Was this translation helpful? Give feedback.
All reactions