#networkx — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #networkx, aggregated by home.social.
-
City2Graph: Easy graph generation in Python: #City2Graph is an open-source #Python package that turns geospatial data into #graph structures for #NetworkAnalysis and Graph Neural Networks, with seamless integration into tools like #GeoPandas, #NetworkX, and #PyTorch Geometric. It supports...
https://spatialists.ch/posts/2026/04/18-city2graph-easy-graph-generation-in-python/ #GIS #GISchat #geospatial #SwissGIS -
City2Graph: Easy graph generation in Python: #City2Graph is an open-source #Python package that turns geospatial data into #graph structures for #NetworkAnalysis and Graph Neural Networks, with seamless integration into tools like #GeoPandas, #NetworkX, and #PyTorch Geometric. It supports...
https://spatialists.ch/posts/2026/04/18-city2graph-easy-graph-generation-in-python/ #GIS #GISchat #geospatial #SwissGIS -
City2Graph: Easy graph generation in Python: #City2Graph is an open-source #Python package that turns geospatial data into #graph structures for #NetworkAnalysis and Graph Neural Networks, with seamless integration into tools like #GeoPandas, #NetworkX, and #PyTorch Geometric. It supports...
https://spatialists.ch/posts/2026/04/18-city2graph-easy-graph-generation-in-python/ #GIS #GISchat #geospatial #SwissGIS -
City2Graph: Easy graph generation in Python: #City2Graph is an open-source #Python package that turns geospatial data into #graph structures for #NetworkAnalysis and Graph Neural Networks, with seamless integration into tools like #GeoPandas, #NetworkX, and #PyTorch Geometric. It supports...
https://spatialists.ch/posts/2026/04/18-city2graph-easy-graph-generation-in-python/ #GIS #GISchat #geospatial #SwissGIS -
CW: AdventOfCode 2025 Day 11 Visualization
Quick visualization while untangling AoC 2025 Day 11 Part 2.
-
CW: AdventOfCode 2025 Day 11 Visualization
Quick visualization while untangling AoC 2025 Day 11 Part 2.
-
📦 affiliation-builder v0.2.0: a #Python package for creating bipartite affiliation networks from #JSON using #NetworkX.
🌐 https://pypi.org/project/affiliation-builder/
Generic enough for any affiliation data you throw at it, but I'm developing it specifically as part of a workflow that makes #TEI listEvent accessible to #networkanalysis. More soon ...
Feedback welcome!
-
📦 affiliation-builder v0.2.0: a #Python package for creating bipartite affiliation networks from #JSON using #NetworkX.
🌐 https://pypi.org/project/affiliation-builder/
Generic enough for any affiliation data you throw at it, but I'm developing it specifically as part of a workflow that makes #TEI listEvent accessible to #networkanalysis. More soon ...
Feedback welcome!
-
This week we will be at #NetworkX in #Paris! We are bringing our brand #new #opensource #secure #wifi #router - #OmniaNG! If you couldn't make it to #LinuxDays last week, here is another chance to see it IRL! You can also visit our #stand to talk to us about other #CZNIC projects like #Bird and #Knot #Resolver - #routing and #dns. See you in Paris!
-
This week we will be at #NetworkX in #Paris! We are bringing our brand #new #opensource #secure #wifi #router - #OmniaNG! If you couldn't make it to #LinuxDays last week, here is another chance to see it IRL! You can also visit our #stand to talk to us about other #CZNIC projects like #Bird and #Knot #Resolver - #routing and #dns. See you in Paris!
-
🤩 Fantastic new network plotting package available in Python by Fabio Zanini. The package supports both #networkx :networkx: and #igraph :igraph: networks, and has a wide variety of styling options.
https://iplotx.readthedocs.io/en/latest/Reposting on Mastodon - Source: https://bsky.app/profile/vtraag.bsky.social/post/3m2bjcckons2f
-
🤩 Fantastic new network plotting package available in Python by Fabio Zanini. The package supports both #networkx :networkx: and #igraph :igraph: networks, and has a wide variety of styling options.
https://iplotx.readthedocs.io/en/latest/Reposting on Mastodon - Source: https://bsky.app/profile/vtraag.bsky.social/post/3m2bjcckons2f
-
«Welcome to the #AutomatingGIS processes course! Through interactive lessons and hands-on exercises, this course introduces you to #GeographicDataAnalysis using the #Python programming language. If you are new to Python, we recommend you first start with the Geo-Python course (geo-python.readthedocs.io) before diving into using it for GIS analyses in this course.
Geo-Python and Automating GIS Processes (‘#AutoGIS’) have been developed by the Department of Geosciences and Geography at the University of Helsinki, Finland. The course has been planned and organized by the #DigitalGeographyLab. The teaching materials are openly accessible for anyone interested in learning.»
https://autogis-site.readthedocs.io/en/latest/
(via Paul Walter no linkedin)
-
«Welcome to the #AutomatingGIS processes course! Through interactive lessons and hands-on exercises, this course introduces you to #GeographicDataAnalysis using the #Python programming language. If you are new to Python, we recommend you first start with the Geo-Python course (geo-python.readthedocs.io) before diving into using it for GIS analyses in this course.
Geo-Python and Automating GIS Processes (‘#AutoGIS’) have been developed by the Department of Geosciences and Geography at the University of Helsinki, Finland. The course has been planned and organized by the #DigitalGeographyLab. The teaching materials are openly accessible for anyone interested in learning.»
https://autogis-site.readthedocs.io/en/latest/
(via Paul Walter no linkedin)
-
🐍 Join us next month at the Houston Python Meetup! 🐍
📅 July 15, 2025 | 6:00-8:00 PM
📍 Improving, 10111 Richmond Ave, Houston
Featured talk: "Finding Meaning in Connections: A Practical Demo with NetworkX" by Walker Hale - learn how graph-based analysis can unlock insights from complex, interconnected data.
Plus lightning talks, networking, and refreshments! Perfect for Python developers at any level.
-
Еще чуть-чуть быстрее ищем кратчайший путь на Python
Привет! На связи команда геоаналитики ecom.tech , мы строим модели машинного обучения на основе пространственных данных для задач ритейла в реальном времени, а также создаем промежуточные инструменты на базе методов прикладной геоаналитики. На наших технологиях работает Самокат и Мегамаркет. Например, наша команда решает задачу поиска оптимального расположения даркстора (место, где хранятся продукты, а также собираются заказы). Зона покрытия даркстора — радиус в пару километров, и количество их постоянно увеличивается. Мы хотим уметь размещать новый даркстор так, чтобы как можно больше людей получали заказы за минимальное время доставки. В этой статье мы расскажем, как выбираем локации для новых дарксторов: определимся с постановкой задачи, погрузимся в контекст проекта и покажем, как можно анализировать сотни тысяч разных точек на карте в секунду.
https://habr.com/ru/companies/ecom_tech/articles/911732/
#python #networkx #open_street_map #геоданные #геоинформационные_сервисы
-
I started by importing all nodes and edges into #NetworkX, incorporating changes step-by-step, and visualizing the graph at each stage to spot any anomalies.
Now, I’m translating from NetworkX operations to database operations to implement these changes in the production database via Django shell.
6/6
-
I started by importing all nodes and edges into #NetworkX, incorporating changes step-by-step, and visualizing the graph at each stage to spot any anomalies.
Now, I’m translating from NetworkX operations to database operations to implement these changes in the production database via Django shell.
6/6
-
#networkx #TSP approximation Code at: https://github.com/villares/sketch-a-day/tree/main/2025/sketch_2025_02_09
More sketch-a-day: https://abav.lugaralgum.com/sketch-a-day
If you like this, support my work: https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724 #Processing #Python #py5 #CreativeCoding -
#networkx #TSP approximation Code at: https://github.com/villares/sketch-a-day/tree/main/2025/sketch_2025_02_09
More sketch-a-day: https://abav.lugaralgum.com/sketch-a-day
If you like this, support my work: https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724 #Processing #Python #py5 #CreativeCoding -
#MinimumSpanningTree #networkx Code at: https://github.com/villares/sketch-a-day/tree/main/2025/sketch_2025_02_08
More sketch-a-day: https://abav.lugaralgum.com/sketch-a-day
If you like this, support my work: https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724 #Processing #Python #py5 #CreativeCoding -
#MinimumSpanningTree #networkx Code at: https://github.com/villares/sketch-a-day/tree/main/2025/sketch_2025_02_08
More sketch-a-day: https://abav.lugaralgum.com/sketch-a-day
If you like this, support my work: https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724 #Processing #Python #py5 #CreativeCoding -
#networkx #MinimumSpanningTree Code at: https://github.com/villares/sketch-a-day/tree/main/2025/sketch_2025_02_07
More sketch-a-day: https://abav.lugaralgum.com/sketch-a-day
If you like this, support my work: https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724 #Processing #Python #py5 #CreativeCoding -
#networkx #MinimumSpanningTree Code at: https://github.com/villares/sketch-a-day/tree/main/2025/sketch_2025_02_07
More sketch-a-day: https://abav.lugaralgum.com/sketch-a-day
If you like this, support my work: https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724 #Processing #Python #py5 #CreativeCoding -
Coding question. What could be the reason behind getting different error messages when running the same code multiple times? The code has no random elements, does not depend on external data, etc.
Code is python3 with the networkx package. One run gives the error:
networkx.exception.NetworkXError: The node 225B is not in the graph.
Run it again, and it gives:
networkx.exception.NetworkXError: The node 256B is not in the graph.What the heck? I know this is a very general question, but what could cause this kind of thing? Could networkx be representing the graph internally in different ways with each run? Why would it do that?
Any thoughts much appreciated!
(I know the problem is likely due to my efforts to modify a graph as I am iterating over it, which I know causes problems, and I'm working on a workaround, but why the changing errors?)
-
Coding question. What could be the reason behind getting different error messages when running the same code multiple times? The code has no random elements, does not depend on external data, etc.
Code is python3 with the networkx package. One run gives the error:
networkx.exception.NetworkXError: The node 225B is not in the graph.
Run it again, and it gives:
networkx.exception.NetworkXError: The node 256B is not in the graph.What the heck? I know this is a very general question, but what could cause this kind of thing? Could networkx be representing the graph internally in different ways with each run? Why would it do that?
Any thoughts much appreciated!
(I know the problem is likely due to my efforts to modify a graph as I am iterating over it, which I know causes problems, and I'm working on a workaround, but why the changing errors?)
-
I've completed "LAN Party" - Day 23 - Advent of Code 2024
networkx made very short work of this one. Now to finish up Part 2 on days 21 and 22.
https://github.com/jstanden/advent-of-code-python/blob/main/2024/day23.ipynb
-
I've completed "LAN Party" - Day 23 - Advent of Code 2024
networkx made very short work of this one. Now to finish up Part 2 on days 21 and 22.
https://github.com/jstanden/advent-of-code-python/blob/main/2024/day23.ipynb
-
I don't do a lot of #NetworkAnalysis in my work, but there are many in @digigeolab who do, and presumably here as well.
I know #NetworkX is a commonly used Python library for such analysis, but it is a bit slow. However, there is a new spin of it called #RustworkX written in Rust, which makes it blisteringly fast.
Here are some benchmarks: https://www.rustworkx.org/dev/benchmarks.html
Has anyone tried it? Any opinions?
-
I don't do a lot of #NetworkAnalysis in my work, but there are many in @digigeolab who do, and presumably here as well.
I know #NetworkX is a commonly used Python library for such analysis, but it is a bit slow. However, there is a new spin of it called #RustworkX written in Rust, which makes it blisteringly fast.
Here are some benchmarks: https://www.rustworkx.org/dev/benchmarks.html
Has anyone tried it? Any opinions?
-
I recently read a paper by Kleshnina and others and used it to teach myself some evolutionary game theory techniques.
This is a little obscure, so I'll thread below about why this topic matters for humans and the environment 🧵
https://nadiah.org/2024/11/20/kleshnina_2023
#GameTheory #PrisonersDilemma #iteratedGame #cooperation #EvolutionOfCooperation #Z3 #pyeda #networkx #sympy #SageMath #sustainability
-
I recently read a paper by Kleshnina and others and used it to teach myself some evolutionary game theory techniques.
This is a little obscure, so I'll thread below about why this topic matters for humans and the environment 🧵
https://nadiah.org/2024/11/20/kleshnina_2023
#GameTheory #PrisonersDilemma #iteratedGame #cooperation #EvolutionOfCooperation #Z3 #pyeda #networkx #sympy #SageMath #sustainability
-
Let's sum up my impressions on #networkanalysis tools: #Gephi seems to be the tool for the network in-between and continues to be standard for starting. However, #networkx gives most freedom in modelling, but requires advanced Python skills. If you work in the 1500-1800 period, you should use #Palladio for linking your data with others. If your data is really big, you might go straight to #Cytoscape and if you want to combine with webscraping having too much money you can use #NodeXL. Agree? ;-)
-
Exploring Network Dynamics with #NetworkX on #Linux
https://www.linuxjournal.com/content/exploring-network-dynamics-networkx-linux
-
Getting to the final stages of completing a new river network for Ireland, and then canals come along and cause all sorts of problems with flow. 🌊 #rivers #hydrology #networkx
-
Please help - #networkScience question: I need to extract the set of face cycles https://en.wikipedia.org/wiki/Cycle_basis#Face_cycles from a #planar graph, preferrably via Python (#networkx, #igraph, etc :networkx: :igraph:). I used networkx' minimum_cycle_basis() method so far, but I realized the minimum cycle basis is generally not the same as the face cycles. Does anybody know if there is a function for that in one of the common libraries? I want to avoid writing it myself if it's already out there.
-
Van 8 tm 10 oktober vindt #NetworkX plaats in Parijs. Congres en beurs trekken een wereldwijd publiek van meer dan 5.000 professionals uit de telecomwereld. NLconnect is event partner.
De conferentie heeft een volgepakte en boeiende agenda met sessies over oa de evolutie van RAN, ontwikkelingen in smart home, AI, Quantum, private 5G, next gen PON en FWA.
Tickets zijn verkrijgbaar via https://networkxevent.com/ Voor leden van NLconnect is een 15% kortingcode beschikbaar
-
#networkx #graphviz Code at: https://github.com/villares/sketch-a-day/tree/main/2024/sketch_2024_08_17
More sketch-a-day: https://abav.lugaralgum.com/sketch-a-day
I really need your support to keep going, if you can, donate any amount at: https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724 #Processing #Python #py5 #CreativeCoding -
#networkx Code at: https://github.com/villares/sketch-a-day/tree/main/2024/sketch_2024_08_15
More sketch-a-day: https://abav.lugaralgum.com/sketch-a-day
I really need your support to keep going, if you can, donate any amount at: https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724 #Processing #Python #py5 #CreativeCoding