networkx-discuss

1–30 of 2302

0 selected

Sally Chen, Dan Schult2

Feb 6

read pickle file

That function is not available in v3.0 (it has been deprecated). The document called "Migration

unread,

read pickle file

That function is not available in v3.0 (it has been deprecated). The document called "Migration

Feb 6

akshay yeddanapudi

Feb 3

adding weights to eccentricity calculations

Hi all, I am trying to add edge weights to get the eccentricities of a weighted graph and am unable

unread,

adding weights to eccentricity calculations

Hi all, I am trying to add edge weights to get the eccentricities of a weighted graph and am unable

Feb 3

Elvis Shera, … Nicolas Cadieux15

Feb 2

Locating node based on attributes

Hi, I hope this example will help. Cut and paste in a .py file and run it. # ========================

unread,

Locating node based on attributes

Hi, I hope this example will help. Cut and paste in a .py file and run it. # ========================

Feb 2

AR, Nicolas Cadieux3

Jan 31

Graph disconnecting at 4-edge vertices

I spent a bit more time with the issue, and found that the problem was actually what you say - with

unread,

Graph disconnecting at 4-edge vertices

I spent a bit more time with the issue, and found that the problem was actually what you say - with

Jan 31

Jan 27

subgraph appending

Does anyone know if you can delete a cut-vertex and then get network x to recognize all the new

unread,

subgraph appending

Does anyone know if you can delete a cut-vertex and then get network x to recognize all the new

Jan 27

Thomas Balstrøm

Jan 19

Hi you clever people out there, I use this Pyhon statement to identify edges in a directed graph, G,

unread,

Hi you clever people out there, I use this Pyhon statement to identify edges in a directed graph, G,

Jan 19

Jan 19

Regarding neighbor’s neighbor

Hlo all, I am a Ph.D student, working in igraph-Python. Can any one please help me out that how can i

unread,

Regarding neighbor’s neighbor

Hlo all, I am a Ph.D student, working in igraph-Python. Can any one please help me out that how can i

Jan 19

Johannes Erwerle, … Dan Schult4

Jan 19

Searching for a good issue to work on

Hi Dan, thanks for the quick response. On 19/01/2023 17.52, Dan Schult wrote: > It may take longer

unread,

Searching for a good issue to work on

Hi Dan, thanks for the quick response. On 19/01/2023 17.52, Dan Schult wrote: > It may take longer

Jan 19

chuchedulce, Nicolas Cadieux2

Jan 16

Find all shorters paths between one list of sources and other of targets

Hi, I am not sure if it's implemented directly in network x but I have implement a version for

unread,

Find all shorters paths between one list of sources and other of targets

Hi, I am not sure if it's implemented directly in network x but I have implement a version for

Jan 16

Jan 8

Submitted PR to add DiGraph support in common_neighbors

Can I get a review of PR 6301? I've just been using my own local version of this function, but it

unread,

Submitted PR to add DiGraph support in common_neighbors

Can I get a review of PR 6301? I've just been using my own local version of this function, but it

Jan 8

MUHAMMAD WAQAS SWATI, Dan Schult3

Jan 4

Unable to write waxman random graph using graphml in Networkx

I appreciate your prompt response. I opted for the second solution and it worked. Kind Regards On

unread,

Unable to write waxman random graph using graphml in Networkx

I appreciate your prompt response. I opted for the second solution and it worked. Kind Regards On

Jan 4

12/9/22

Clustered planarity?

Is it possible to use networkx to find planarity for groups of clusters? Like for example 3 points

unread,

Clustered planarity?

Is it possible to use networkx to find planarity for groups of clusters? Like for example 3 points

12/9/22

Franck Kalala, Ross Barnowski3

12/2/22

nx.adjacency_matrix return an error: a bug?

Thanks Ross F ----- Le ven. 2 déc. 2022 à 16:46, Ross Barnowski <ross...@gmail.com> a écrit :

unread,

nx.adjacency_matrix return an error: a bug?

Thanks Ross F ----- Le ven. 2 déc. 2022 à 16:46, Ross Barnowski <ross...@gmail.com> a écrit :

12/2/22

Emma Van Hoogmoed, Dan Schult6

11/27/22

Ask for help: Network-X edge_betweeness_centrality function does not take weight into account

Oh! Okay, so I'd just have to figure out a way of adding link and node objects to the preexisting

unread,

Ask for help: Network-X edge_betweeness_centrality function does not take weight into account

Oh! Okay, so I'd just have to figure out a way of adding link and node objects to the preexisting

11/27/22

Tamandeep Singh, … Jarrod Millman3

11/26/22

New Contributor Here

Hi Tamandeep, Check out our developer guide: https://networkx.org/documentation/latest/developer/

unread,

New Contributor Here

Hi Tamandeep, Check out our developer guide: https://networkx.org/documentation/latest/developer/

11/26/22

ALEJANDRO VELAZQUEZ JIMENEZ, Jann Poppinga2

11/17/22

You're in the wrong mailing list. This is about the Python library NetworkX, handling the

unread,

You're in the wrong mailing list. This is about the Python library NetworkX, handling the

11/17/22

11/2/22

PR Review Request for #6167

I've added a node coloring algorithm that is a sampling based version of the Recursive Largest

unread,

PR Review Request for #6167

I've added a node coloring algorithm that is a sampling based version of the Recursive Largest

11/2/22

10/21/22

New proposed layout function: circular layout with a node in center

All, After adjusting circular_layout for a use case I needed a node in the center, I have created a

unread,

New proposed layout function: circular layout with a node in center

All, After adjusting circular_layout for a use case I needed a node in the center, I have created a

10/21/22

caibo Zhou, David Menéndez Hurtado5

10/15/22

Ask for help: the networkx==2.8.7 is incompatiblewith matplotlib==3.6.1

Thanks for your help! I install python via conda ，and the matplotlib work well. Caibo Zhou 在 2022年10月

unread,

Ask for help: the networkx==2.8.7 is incompatiblewith matplotlib==3.6.1

Thanks for your help! I install python via conda ，and the matplotlib work well. Caibo Zhou 在 2022年10月

10/15/22

Paula Pérez Bianchi2

10/13/22

Solved issue 6035

Initially, the issue was to add coverage to stochastic.py by adding tests to test_stochastic.py. That

unread,

Solved issue 6035

Initially, the issue was to add coverage to stochastic.py by adding tests to test_stochastic.py. That

10/13/22

Saverio, Borjan Milinkovic2

10/8/22

Problem with plotting a MultiDiGraph instance

Hi Saverio, I'd like to double up on this actually. This has been happening to me too. Any hints

unread,

Problem with plotting a MultiDiGraph instance

Hi Saverio, I'd like to double up on this actually. This has been happening to me too. Any hints

10/8/22

Matt Hall, Chris Myers3

9/29/22

'Weight': affinity vs distance

Hi Chris, Thank you very much for the illuminating reply. Glad to hear I was on something like the

unread,

'Weight': affinity vs distance

Hi Chris, Thank you very much for the illuminating reply. Glad to hear I was on something like the

9/29/22

9/14/22

Review request for #5945

Hello! I've submitted a small PR that fixes an inconsistency between the Dijkstra's and A*

unread,

Review request for #5945

Hello! I've submitted a small PR that fixes an inconsistency between the Dijkstra's and A*

9/14/22

Dennis, Dan Schult3

9/1/22

Ask for help: Plot data without a target point

thank you for your response. The problem I see is that the nodes without an outgoing connection are

unread,

Ask for help: Plot data without a target point

thank you for your response. The problem I see is that the nodes without an outgoing connection are

9/1/22

Francesco Lomonaco

8/23/22

[JOBS] 1 Post-Doc open Positions on AI-ML to understand and contrast social media threats for teenagers

######### Apologize for cross posting ######### [on the behalf of Professor Dimitri Ognibene] Dear

unread,

[JOBS] 1 Post-Doc open Positions on AI-ML to understand and contrast social media threats for teenagers

######### Apologize for cross posting ######### [on the behalf of Professor Dimitri Ognibene] Dear

8/23/22

Nicolas Cadieux, … Dale Brearcliffe3

8/21/22

You also might consider looking for such papers in the Computational Social Science field. You may be

unread,

You also might consider looking for such papers in the Computational Social Science field. You may be

8/21/22

Eneko Valero, Ross Barnowski2

8/16/22

RuntimeError: In draw_glyphs_to_bitmap: Could not convert glyph to bitmap (error code 0x62)

nx.draw uses matplotlib under-the-hood, which is where the RuntimeError is originating. This likely

unread,

RuntimeError: In draw_glyphs_to_bitmap: Could not convert glyph to bitmap (error code 0x62)

nx.draw uses matplotlib under-the-hood, which is where the RuntimeError is originating. This likely

8/16/22

Amrtanshu Bharadwaj, … amin asadi4

8/15/22

Generate subgraph of max 'k' nodes

tanks my friend ‫‪David Menéndez Hurtado‬‏ <‪david...@gmail.com‬‏> در تاریخ جمعه ۱۲ اوت ۲۰۲۲

unread,

Generate subgraph of max 'k' nodes

tanks my friend ‫‪David Menéndez Hurtado‬‏ <‪david...@gmail.com‬‏> در تاریخ جمعه ۱۲ اوت ۲۰۲۲

8/15/22

Matthew Kline, Dan Schult4

8/11/22

ego graph shell layout with less than 2 dimensions

H = nx.star_graph([item] + others) # just make a list with center node first and the "rim nodes

unread,

ego graph shell layout with less than 2 dimensions

H = nx.star_graph([item] + others) # just make a list with center node first and the "rim nodes

8/11/22

杨guang, Siti Haryanti Hj Hairol Anuar2

8/5/22

How to make a node moving in network’s edges

hi, i also doing this research. Are make it the moving dynamic community detection? please share the

unread,

How to make a node moving in network’s edges

hi, i also doing this research. Are make it the moving dynamic community detection? please share the

8/5/22

Search

Clear search

Close search

Google apps

Main menu