networkx-discuss

Yes -- when you have a working PR, you should submit that to the NX repo. Of course, read the

Dear NetworkX Maintainers, I've submitted PR #7974 implementing the AlphaCore algorithm, and I

Hi, my implementation of the SMA* algorithm in PR #7970 is failing the IC check because a label is

Thanks for the quick (re)review. Unfortunately there were still some issues which required fixing. I

Hi! My IDA* algorithm implementation #7965 PR is failing the CI check due to a missing type: label.

Dear NetworkX Team, I hope this message finds you well! We wanted to kindly follow up on our second

Hi Tianming, It's great to hear from you! I really appreciate your interest in the Pedagogical

Dear NetworkX Developers, I have submitted a pull request (https://github.com/networkx/networkx/pull/

Gentle reminder for reviewing PR. Best, Rajendra On Friday, March 7, 2025 at 8:09:25 PM UTC+5:30

I suggest you stop a minute and think about what a node means to you and your data. If the data says

I'm referring to graphlet or subgraph matching in a larger graph - yes, an isomorphism test -

Hi Susan, Glad to hear about your interest in adding further graph coloring functionality to networkx

Hi Thomas, Thanks for thr feedback, and good to hear you've got it working. I've deliberately

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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