Use available graph python package?

[brandimarte]

There are many python network/graph packages out there. With a quick search one can find for instance 'NetworkX' package. So the following questions arise:

1. Could we take advantage of the already implemented algorithms in those packages?
2. If answer of '1' is 'yes', which package would suit us better?

[brandimarte]

With NetworkX, the solution to the problem of finding all elementary graphs could be solved with:

import networkx as nx
import matplotlib.pyplot as plt

# Create Directed Graph
G=nx.DiGraph()

# Add a list of nodes:
G.add_nodes_from(["a","b","c","d","e"])

# Add a list of edges:
G.add_edges_from([("a","b"),("b","c"), ("c","a"), ("b","d"), ("d","e"), ("e","a")])

# Return a list of cycles described as a list o nodes
list(nx.simple_cycles(G))

It relies on directed graph though.