-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Dear Everyone
I am interested in finding a path (not necessarily shortest) in a short amount of time. Dijsktra and AStar in networkx is taking too long.
Why is there no DFS or BFS in networkx?
I plan to write my own DFS and BFS search (I am leaning more towards BFS because my graph is pretty deep)…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
hi,
i am trying to use networkx with python, when i run this program, it get this error, is there anything missing?
#!/usr/bin/env python
import networkx as nx
import matplotlib
import matplotlib.pyplot
import matplotlib.pyplot as plt
G=nx.Graph()
G.add_node(1)
G.add_nodes_from([2,3,4,5,6,7,8…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I made a code for generate a graph with 379613734 edges.
But the code couldn't be finished because of memory. It takes about 97% of server memory when it go through 62 million lines. So I killed it.
Do you have any idea to solve this problem?
My code is like this:
import os, sys
import time
import…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I want to compare nodes of different edges in the graph. how can I get the nodes(n1 and n2) from the edge(n1,n2)?
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm using networkx to work with graphs. I have pretty large graph (it's near 200 nodes in it) and I try to find all possible paths between two nodes. But, as I understand, networkx can find only shortest path. How can I get not just shortest path, but all possible paths?
>>> More
