networkx-discuss

1–30 of 2282

0 selected

Matt Hall, Chris Myers3

Sep 29

'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

Sep 29

Sep 14

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*

Sep 14

Dennis, Dan Schult3

Sep 1

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

Sep 1

Francesco Lomonaco

Aug 23

[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

Aug 23

Nicolas Cadieux, … Dale Brearcliffe3

Aug 21

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

Aug 21

Eneko Valero, Ross Barnowski2

Aug 16

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

Aug 16

Aug 15

Problem with plotting a MultiDiGraph instance

Hi all, I have executed the following code: import networkx as nx import matplotlib.pyplot as plt

unread,

Problem with plotting a MultiDiGraph instance

Hi all, I have executed the following code: import networkx as nx import matplotlib.pyplot as plt

Aug 15

Amrtanshu Bharadwaj, … amin asadi4

Aug 15

Generate subgraph of max 'k' nodes

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

unread,

Generate subgraph of max 'k' nodes

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

Aug 15

Matthew Kline, Dan Schult4

Aug 11

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

Aug 11

杨guang, Siti Haryanti Hj Hairol Anuar2

Aug 5

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

Aug 5

Muhammed Ömer Taylan, Mridul Seth2

Aug 2

Why am I getting different community detection results for NetworkX?

Hello! I'm not able to reproduce this, could you please open a new issue at https://github.com/

unread,

Why am I getting different community detection results for NetworkX?

Hello! I'm not able to reproduce this, could you please open a new issue at https://github.com/

Aug 2

Aug 1

ask for help: multilayer network

hello community I am using uunet the library of multinet for community detection in multilayer

unread,

ask for help: multilayer network

hello community I am using uunet the library of multinet for community detection in multilayer

Aug 1

Daniel Burns, Dan Schult3

Jul 28

Girvan-Newman record of removed edges

Thank you! Works great - I added the list as an argument to the function before trying it verbatim.

unread,

Girvan-Newman record of removed edges

Thank you! Works great - I added the list as an argument to the function before trying it verbatim.

Jul 28

Michael, Dan Schult2

Jul 27

louvain_partitions generator issue

Something is wrong here... perhaps to do with yield and return being used in the same function. Can

unread,

louvain_partitions generator issue

Something is wrong here... perhaps to do with yield and return being used in the same function. Can

Jul 27

ali darwich, Dan Schult4

Jul 26

Graph display problem with images instead of nodes

Maybe open an issue at https://github.com/networkx/networkx/issues with a (hopefully short) example

unread,

Graph display problem with images instead of nodes

Maybe open an issue at https://github.com/networkx/networkx/issues with a (hopefully short) example

Jul 26

Gordon Julian Köhn, Dan Schult4

Jul 25

Average Shortest Path Length below 1 ?

Yes, that is correct. Nodes that cannot be connected are counted as distance 0 when getting the

unread,

Average Shortest Path Length below 1 ?

Yes, that is correct. Nodes that cannot be connected are counted as distance 0 when getting the

Jul 25

Jul 21

Ask for help: Hierarchy

Hi guys, I am really newbie in Math and Social Network. I want to ask is my code is the correct

unread,

Ask for help: Hierarchy

Hi guys, I am really newbie in Math and Social Network. I want to ask is my code is the correct

Jul 21

Gonzalo, Ross Barnowski2

Jul 20

Sparse way to compute the google matrix

Hi Gonzalo, That's a great question... At first glance, I don't see anything that would

unread,

Sparse way to compute the google matrix

Hi Gonzalo, That's a great question... At first glance, I don't see anything that would

Jul 20

Jul 18

Review Request for #5879

Hi all, looking for reviewers for this PR: https://github.com/networkx/networkx/pull/5879 The issue

unread,

Review Request for #5879

Hi all, looking for reviewers for this PR: https://github.com/networkx/networkx/pull/5879 The issue

Jul 18

Cheng Xi Chen, Dan Schult3

Jul 15

How to add/set node attributes to grid_2d_graph from numpy array/Pandas dataFrame

Hi, df.to_dict() solved my problem. Thanks! Regards, -cheng xi On Friday, 15 July 2022 at 10:14:53

unread,

How to add/set node attributes to grid_2d_graph from numpy array/Pandas dataFrame

Hi, df.to_dict() solved my problem. Thanks! Regards, -cheng xi On Friday, 15 July 2022 at 10:14:53

Jul 15

guilherme ribeiro

Jun 29

Spanning Edge Betweenness

I am a student in Instituto Superior Técnico - https://tecnico.ulisboa.pt/en/ - and in my MSc's

unread,

Spanning Edge Betweenness

I am a student in Instituto Superior Técnico - https://tecnico.ulisboa.pt/en/ - and in my MSc's

Jun 29

Jun 21

How to get NetworkX metrics to update with Plotly Dash callbacks

I have a networkx/plotly/dash project I have been working on. My network updates with a dropdown in

unread,

How to get NetworkX metrics to update with Plotly Dash callbacks

I have a networkx/plotly/dash project I have been working on. My network updates with a dropdown in

Jun 21

Emma Van Hoogmoed, … Nicolas Cadieux4

Jun 19

G.add_edges_from also adds to the node list

That was it! I wasn't attaching them to the nodes correctly. Thank you. On Saturday, June 18,

unread,

G.add_edges_from also adds to the node list

That was it! I wasn't attaching them to the nodes correctly. Thank you. On Saturday, June 18,

Jun 19

Jun 19

Break astar ties using heuristic value (review request)

Greetings, I have updated the astar implementation to break ties using the heuristic value. The PR

unread,

Break astar ties using heuristic value (review request)

Greetings, I have updated the astar implementation to break ties using the heuristic value. The PR

Jun 19

Mostafa Kheyrollahi

Jun 13

optimisation of Steiner Tree in networkx

Deal all, I use the Steiner-Tree tool from Networkx library to find the best possible route between

unread,

optimisation of Steiner Tree in networkx

Deal all, I use the Steiner-Tree tool from Networkx library to find the best possible route between

Jun 13

Matt Barnes, Ross Barnowski2

Jun 9

Adding Equality and Hierarchical Mobility measurements

Hi Matthew, Congratulations on your recent publication! Re: inclusion in NetworkX, there is no "

unread,

Adding Equality and Hierarchical Mobility measurements

Hi Matthew, Congratulations on your recent publication! Re: inclusion in NetworkX, there is no "

Jun 9

Jun 4

NetworkX 2.8.3 released

I am happy to announce NetworkX 2.8.3! This is the last release before the upcoming 3.0 release. The

unread,

NetworkX 2.8.3 released

I am happy to announce NetworkX 2.8.3! This is the last release before the upcoming 3.0 release. The

Jun 4

May 27

Directed edge swaps (PR 5663)

Hi everyone! I put together a PR (https://github.com/networkx/networkx/pull/5663) implementing an

unread,

Directed edge swaps (PR 5663)

Hi everyone! I put together a PR (https://github.com/networkx/networkx/pull/5663) implementing an

May 27

May 12

Ego_Graph Edges

Hello All!, I have been working on a project where I created a function to search a larger network

unread,

Ego_Graph Edges

Hello All!, I have been working on a project where I created a function to search a larger network

May 12

Matthew Kline, Dan Schult7

May 12

Network Analysis Ego Graph Layout

Actually, I got everything to work! One final question. The graph visually looks much better now that

unread,

Network Analysis Ego Graph Layout

Actually, I got everything to work! One final question. The graph visually looks much better now that

May 12

Search

Clear search

Close search

Google apps

Main menu