networkx-discuss

Contact owners and managers

1–30 of 2401

0 selected

12/20/24

Query regarding GSOC

Hello, I wanted to know if networkx is planning to participate in GSOC'25... Kindly let me know

unread,

Query regarding GSOC

Hello, I wanted to know if networkx is planning to participate in GSOC'25... Kindly let me know

12/20/24

Scott VR, Russell Jurney2

12/9/24

Announcing PHART: Pure Python ASCII Graph Visualization

This is beautiful. I needed this just the other day for a README :) On Mon, Dec 9, 2024 at 5:29 PM

unread,

Announcing PHART: Pure Python ASCII Graph Visualization

This is beautiful. I needed this just the other day for a README :) On Mon, Dec 9, 2024 at 5:29 PM

12/9/24

12/1/24

Request for Review: Fix for Issue #7645

Dear NetworkX Developers, I have submitted a pull request to address [issue #7645](https://github.com

unread,

Request for Review: Fix for Issue #7645

Dear NetworkX Developers, I have submitted a pull request to address [issue #7645](https://github.com

12/1/24

11/22/24

Implementation of Some Algorithms for the Densest Subgraph Problem

Hi Everyone, My name is Farouk, I'm a first time contributor. I've sent in a PR that

unread,

Implementation of Some Algorithms for the Densest Subgraph Problem

Hi Everyone, My name is Farouk, I'm a first time contributor. I've sent in a PR that

11/22/24

10/23/24

Local Community Detection

Hi All, I have recently been working a lot with large graphs where it is infeasible to do global

unread,

Local Community Detection

Hi All, I have recently been working a lot with large graphs where it is infeasible to do global

10/23/24

Ben Griffin, Dan Schult2

10/3/24

Kamada-Kawai for networks with 10^5 + nodes.

Kamada-Kawai uses an optimization that requires all-to-all distance calculations -- so it creates

unread,

Kamada-Kawai for networks with 10^5 + nodes.

Kamada-Kawai uses an optimization that requires all-to-all distance calculations -- so it creates

10/3/24

Nelson Aloysio, Eric BEAUSSART2

9/29/24

NetworkX-Temporal: extending NetworkX to dynamic graphs

Hello Dear All ! About Dynamics and then Time, we ca say : No "Events", no Time ! So,

unread,

NetworkX-Temporal: extending NetworkX to dynamic graphs

Hello Dear All ! About Dynamics and then Time, we ca say : No "Events", no Time ! So,

9/29/24

9/23/24

read_dot error - add an extra vertex

I was informed that this bug was fixed in version 2.0.0 of pydot. So you can forget about it. Sorry

unread,

read_dot error - add an extra vertex

I was informed that this bug was fixed in version 2.0.0 of pydot. So you can forget about it. Sorry

9/23/24

9/19/24

I want to create all possible graphs. Input: Graph with n-1 nodes, degree sequence for n nodes.

unread,

I want to create all possible graphs. Input: Graph with n-1 nodes, degree sequence for n nodes.

9/19/24

Ewaryst Polch, … David Menéndez Hurtado7

8/28/24

network 3.2.1 is_tournament() function bug

On Mon, 26 Aug 2024, 22:48 'Ewaryst Polch' via networkx-discuss, <networkx-discuss@

unread,

network 3.2.1 is_tournament() function bug

On Mon, 26 Aug 2024, 22:48 'Ewaryst Polch' via networkx-discuss, <networkx-discuss@

8/28/24

NEERAJ KRISHNA N, Dan Schult2

8/26/24

Inquiry Regarding Implementation of Parameterized Algorithms

We do include exponential time algorithms in networkx. Why do you claim we don't? I hope we don

unread,

Inquiry Regarding Implementation of Parameterized Algorithms

We do include exponential time algorithms in networkx. Why do you claim we don't? I hope we don

8/26/24

Daniel Mota, … David Menéndez Hurtado8

8/20/24

Node visit with time-window

One simple solution is to use the A* algorithm, using the shortest path from the full graph as

unread,

Node visit with time-window

One simple solution is to use the A* algorithm, using the shortest path from the full graph as

8/20/24

aDS, … Sanchit Ram6

8/9/24

Trying to determine the best graph architecture

It might be the case that graphs aren't best suited for this kind of analysis. I think your

unread,

Trying to determine the best graph architecture

It might be the case that graphs aren't best suited for this kind of analysis. I think your

8/9/24

7/26/24

Found some performance optimizations

Hi all, I am an algorithms researcher and I am building a general purpose code optimization program.

unread,

Found some performance optimizations

Hi all, I am an algorithms researcher and I am building a general purpose code optimization program.

7/26/24

7/19/24

Preferred algorithms for exploration?

Hey! I've been making a set of tools for generating network graphs of public records data that

unread,

Preferred algorithms for exploration?

Hey! I've been making a set of tools for generating network graphs of public records data that

7/19/24

7/15/24

Graph Colouring Updates

Hi All, I submitted some new code (and responses to previous feedback) a couple of weeks ago https://

unread,

Graph Colouring Updates

Hi All, I submitted some new code (and responses to previous feedback) a couple of weeks ago https://

7/15/24

Starlin Mini, Dan Schult3

6/2/24

For Graph theory

Thank you sir. On Sat, Jun 1, 2024 at 9:07 PM Dan Schult <dsc...@colgate.edu> wrote: You

unread,

For Graph theory

Thank you sir. On Sat, Jun 1, 2024 at 9:07 PM Dan Schult <dsc...@colgate.edu> wrote: You

6/2/24

Susan Varghese Padath

4/15/24

Edge Coloring Algorithms on Graphs PR #7397

Hello all, https://github.com/networkx/networkx/pull/7397 We have implemented an algorithm for

unread,

Edge Coloring Algorithms on Graphs PR #7397

Hello all, https://github.com/networkx/networkx/pull/7397 We have implemented an algorithm for

4/15/24

Nicholas Bauman

4/11/24

Isomorphism with MultiDiGraph and weighted edges

I am trying to get NetworkX to determine if two graphs are equivalent. Some things about the graphs:

unread,

Isomorphism with MultiDiGraph and weighted edges

I am trying to get NetworkX to determine if two graphs are equivalent. Some things about the graphs:

4/11/24

Sherlock, … Matt Schwennesen8

4/5/24

Looking for some pointers

The performance questions are difficult to answer, I've never tried to push for maximum

unread,

Looking for some pointers

The performance questions are difficult to answer, I've never tried to push for maximum

4/5/24

Nemiche, Mohamed

4/3/24

Complex Systems Conference

5th Edition of World Conference on Complex Systems (WCCS24) Conference Website : http://

unread,

Complex Systems Conference

5th Edition of World Conference on Complex Systems (WCCS24) Conference Website : http://

4/3/24

ellen mariman, Dan Schult3

4/1/24

automatically putting output into networkx and node attributes

Hi, I rewrote my question so that it is more clear: This is the code I have now. I want to get a

unread,

automatically putting output into networkx and node attributes

Hi, I rewrote my question so that it is more clear: This is the code I have now. I want to get a

4/1/24

3/27/24

Asking for Review

Hi, hoping this is the right place to ask for a review: https://github.com/networkx/networkx/pull/

unread,

Asking for Review

Hi, hoping this is the right place to ask for a review: https://github.com/networkx/networkx/pull/

3/27/24

abhishek boken, … abdullah3

3/27/24

You can upload find information from here.https://saturncloud.io/blog/uploading-local-files-using-

unread,

You can upload find information from here.https://saturncloud.io/blog/uploading-local-files-using-

3/27/24

Ashot Vardanian, Russell Jurney2

3/27/24

Scaling NetworkX to largest graphs with UKV

Can UKV work with Neo4j? Sit on top of it? On Saturday, February 18, 2023 at 6:44:53 PM UTC-8 Ashot

unread,

Scaling NetworkX to largest graphs with UKV

Can UKV work with Neo4j? Sit on top of it? On Saturday, February 18, 2023 at 6:44:53 PM UTC-8 Ashot

3/27/24

Amirouche Boubekki, Russell Jurney2

3/27/24

What experiments to you do on very large graphs?

For very large graphs, GraphFrames on PySpark is indispensable. Many people use the connected

unread,

What experiments to you do on very large graphs?

For very large graphs, GraphFrames on PySpark is indispensable. Many people use the connected

3/27/24

Untitled Master, … Dan Schult11

3/20/24

NetworkX allows you to store any data attributes you want on the graph. And some of the function (eg

unread,

NetworkX allows you to store any data attributes you want on the graph. And some of the function (eg

3/20/24

Jennifer DiCarlo, Dan Schult3

3/11/24

Directed Graph Layouts

If it was just the random seed wouldn't the layout be different every time? I have created the

unread,

Directed Graph Layouts

If it was just the random seed wouldn't the layout be different every time? I have created the

3/11/24

m m, Dan Schult2

3/11/24

small-world coefficient

It looks like your correlation array haasn't been thresholded so every possible edge (except self

unread,

small-world coefficient

It looks like your correlation array haasn't been thresholded so every possible edge (except self

3/11/24

Altus, … Ross Barnowski5

3/8/24

Efficiently sorting through a generator of paths in order to find the longest one

Thanks for the reply Ross, just to clear up, it is not a homework problem :). I gathered that the

unread,

Efficiently sorting through a generator of paths in order to find the longest one

Thanks for the reply Ross, just to clear up, it is not a homework problem :). I gathered that the

3/8/24

Search

Clear search

Close search

Google apps

Main menu