hagberg

import networkx as nx
import sys
G=nx.read_gexf(sys.argv[1])
for u,d in G.nodes(data=True):
    print(u,d)
for u,v,d in G.edges(data=True):
    print(u,v,d)
print(G.graph)
print "G",type(G)
nx.write_gexf(G,'test.gexf')

hagberg

"""
DFS with children visited in sorted order.
Nodes must be sortable.

Basic algorithms for depth-first searching.

Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py
by D. Eppstein, July 2004.
"""
__author__ = """\n""".join(['Aric Hagberg <hagberg@lanl.gov>'])

hagberg

<?xml version="1.1" encoding="UTF-8" standalone="no"?>
<graphml xmlns="http://graphml.graphdrawing.org/xmlns" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:y="http://www.yworks.com/xml/graphml" xsi:schemaLocation="http://graphml.graphdrawing.org/xmlns http://www.yworks.com/xml/schema/graphml/1.1/ygraphml.xsd">
  <VersionInfo createdBy="Maltego Radium" subtitle="" version="3.2.1.3453"/>
  <key for="graphml" id="d0" yfiles.type="resources"/>
  <key for="port" id="d1" yfiles.type="portgraphics"/>
  <key for="port" id="d2" yfiles.type="portgeometry"/>
  <key for="port" id="d3" yfiles.type="portuserdata"/>
  <key attr.name="MaltegoEntity" for="node" id="d4" attr.type="string"/>
  <key for="node" id="d5" yfiles.type="nodegraphics"/>
  <key attr.name="MaltegoLink" for="edge" id="d6" attr.type="string"/>

hagberg

NetworkX does not appear to be in the venv: /home/aric/Software/hagberg-networkx/networkx/__init__.pyc
Do you use setupegg.py develop?

hagberg

import networkx as nx
from contextlib import contextmanager

@contextmanager
def hidden(G, nodes=None, edges=None):
    if nodes is None:
        nodes = []
    if edges is None:
        edges = []
    hidden_nodes = [(u,G.node[u]) for u in nodes]

hagberg

import time
import networkx as nx
from contextlib import contextmanager

@contextmanager
def hidden_nodes(G, nodes=None):
    import types
    if nodes is None:
        nodes = []
    def successors_iter(G,n):

hagberg

graph [
 node [
    id 13595
    label 164966
    bytesInAsClient 0
    bytesOutAsServer 0
    ip "10.0.0.1"
    start_time "2013-09-08T13:24:28Z"
    Class "Device"
    coid "11111"

hagberg

import networkx as nx
print nx.__version__
g = nx.gnp_random_graph(1000,0.01)
nx.write_gml(g, 'foo.gml')
for i in range(10000):
    g = nx.read_gml('foo.gml')
    print g.number_of_nodes(), g.number_of_edges()

hagberg

#!/usr/bin/env python

"""Implementation of the Wright, Richmond, Odlyzko and McKay (WROM)
algorithm for the enumeration of all non-isomorphic free trees of a
given order.  Rooted trees are represented by level sequences, i.e.,
lists in which the i-th element specifies the distance of vertex i to
the root."""

import sys

hagberg

from networkx import Graph
from networkx.exception import NetworkXException, NetworkXError
import networkx.convert as convert

class Tree(Graph):
    """ A free (unrooted) tree."""
    def __init__(self, data=None, **attr):
        Graph.__init__(self, **attr)
        if data is not None:
            convert.to_networkx_graph(data, create_using=self)