Python networkx DFS or BFS missing?

Posted by sadawd on Stack Overflow See other posts from Stack Overflow or by sadawd
Published on 2010-03-15T18:09:48Z Indexed on 2010/03/15 18:59 UTC
Read the original article Hit count: 443

Filed under:

networkx

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). Is there anything that I can use in networkx's lib to speed me up?

Thx

Related posts about networkx

Python networkx DFS or BFS missing?

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
python networkx

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
Memory problems while code is running (Python, Networkx)

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
How do I get nodes from the specific edge in the networkx?

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
[python]: path between two nodes

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

Developer IT

Python networkx DFS or BFS missing? - Developer IT

Python networkx DFS or BFS missing?

networkx

Related posts about networkx

Python networkx DFS or BFS missing?

python networkx

Memory problems while code is running (Python, Networkx)

How do I get nodes from the specific edge in the networkx?

[python]: path between two nodes

Categories cloud