Groups
Conversations
All groups and messages
Send feedback to Google
Help
Training
Sign in
Groups
networkx-discuss
Conversations
About
Groups keyboard shortcuts have been updated
Dismiss
See shortcuts
networkx-discuss
1–30 of 2412
Mark all as read
Report group
0 selected
carlos raso alonso
, …
Dan Schult
6
Apr 18
Contribute to networkx community
Yes -- when you have a working PR, you should submit that to the NX repo. Of course, read the
unread,
Contribute to networkx community
Yes -- when you have a working PR, you should submit that to the NX repo. Of course, read the
Apr 18
Prachi Saibewar
Apr 17
PR #7974 - AlphaCore algorithm - label request and dependency issue
Dear NetworkX Maintainers, I've submitted PR #7974 implementing the AlphaCore algorithm, and I
unread,
PR #7974 - AlphaCore algorithm - label request and dependency issue
Dear NetworkX Maintainers, I've submitted PR #7974 implementing the AlphaCore algorithm, and I
Apr 17
rui carvalho
Apr 13
PR #7970
Hi, my implementation of the SMA* algorithm in PR #7970 is failing the IC check because a label is
unread,
PR #7970
Hi, my implementation of the SMA* algorithm in PR #7970 is failing the IC check because a label is
Apr 13
gal michaeli
2
Apr 13
Rereview Request for PR #7774
Thanks for the quick (re)review. Unfortunately there were still some issues which required fixing. I
unread,
Rereview Request for PR #7774
Thanks for the quick (re)review. Unfortunately there were still some issues which required fixing. I
Apr 13
André Meneses
Apr 9
PR IDA* algorithm implementation #7965 Label check
Hi! My IDA* algorithm implementation #7965 PR is failing the CI check due to a missing type: label.
unread,
PR IDA* algorithm implementation #7965 Label check
Hi! My IDA* algorithm implementation #7965 PR is failing the CI check due to a missing type: label.
Apr 9
NEERAJ KRISHNA N
, …
EVANS SAMUEL BIJU
3
Mar 27
Inquiry Regarding Implementation of Parameterized Algorithms
Dear NetworkX Team, I hope this message finds you well! We wanted to kindly follow up on our second
unread,
Inquiry Regarding Implementation of Parameterized Algorithms
Dear NetworkX Team, I hope this message finds you well! We wanted to kindly follow up on our second
Mar 27
Vatsh Van
,
Tianming Liang
3
Mar 25
Introduction & Interest in Pedagogical Interactive Notebooks for GSoC25
Hi Tianming, It's great to hear from you! I really appreciate your interest in the Pedagogical
unread,
Introduction & Interest in Pedagogical Interactive Notebooks for GSoC25
Hi Tianming, It's great to hear from you! I really appreciate your interest in the Pedagogical
Mar 25
Hiroki Hamaguchi
Mar 9
Request for Review: Improve _sparse_fruchterman_reingold with L-BFGS #7889
Dear NetworkX Developers, I have submitted a pull request (https://github.com/networkx/networkx/pull/
unread,
Request for Review: Improve _sparse_fruchterman_reingold with L-BFGS #7889
Dear NetworkX Developers, I have submitted a pull request (https://github.com/networkx/networkx/pull/
Mar 9
Rajendraprasad
3
Mar 9
PR Submission for Approximate Diameter Algorithm & GSoC 2025
Gentle reminder for reviewing PR. Best, Rajendra On Friday, March 7, 2025 at 8:09:25 PM UTC+5:30
unread,
PR Submission for Approximate Diameter Algorithm & GSoC 2025
Gentle reminder for reviewing PR. Best, Rajendra On Friday, March 7, 2025 at 8:09:25 PM UTC+5:30
Mar 9
Dan Schult
Feb 11
Re: [networkx-discuss] Networkx nodes are being overwritten
I suggest you stop a minute and think about what a node means to you and your data. If the data says
unread,
Re: [networkx-discuss] Networkx nodes are being overwritten
I suggest you stop a minute and think about what a node means to you and your data. If the data says
Feb 11
Ralph Liu US
,
Russell Jurney
4
Feb 4
[nx-cugraph] Calling All NetworkX Users Looking for GPU Acceleration
I'm referring to graphlet or subgraph matching in a larger graph - yes, an isomorphism test -
unread,
[nx-cugraph] Calling All NetworkX Users Looking for GPU Acceleration
I'm referring to graphlet or subgraph matching in a larger graph - yes, an isomorphism test -
Feb 4
Susan Varghese Padath
,
Rhyd Lewis
2
Jan 17
Edge Coloring Algorithms on Graphs PR #7397
Hi Susan, Glad to hear about your interest in adding further graph coloring functionality to networkx
unread,
Edge Coloring Algorithms on Graphs PR #7397
Hi Susan, Glad to hear about your interest in adding further graph coloring functionality to networkx
Jan 17
Rhyd Lewis
, …
thomasb...@gmail.com
5
Jan 15
New Graph Coloring Library
Hi Thomas, Thanks for thr feedback, and good to hear you've got it working. I've deliberately
unread,
New Graph Coloring Library
Hi Thomas, Thanks for thr feedback, and good to hear you've got it working. I've deliberately
Jan 15
nidha ahmed
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 Jurney
2
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
Andreas Scharf
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
Elfarouk Harb
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
Matthew Thorne
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 Schult
2
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 BEAUSSART
2
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
André Guedes
2
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
Starlin Mini
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 Hurtado
7
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
Daniel Mota
, …
David Menéndez Hurtado
8
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 Ram
6
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
Saurabh Misra
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
Anthony Moser
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
Rhyd Lewis
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 Schult
3
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
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