# Copyright (c) 2012-2013, Itzik Kotler

# All rights reserved.

#

# Redistribution and use in source and binary forms, with or without

# modification, are permitted provided that the following conditions are met:

#

# * Redistributions of source code must retain the above copyright

# notice, this list of conditions and the following disclaimer.

#

# * Redistributions in binary form must reproduce the above copyright

# notice, this list of conditions and the following disclaimer in the

# documentation and/or other materials provided with the distribution.

#

# * Neither the name of the author nor the names of its contributors may

# be used to endorse or promote products derived from this software without

# specific prior written permission.

#

# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND

# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED

# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE

# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY

# DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES

# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;

# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND

# ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT

# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

import networkx

import networkx.convert

# Local imports

import _ordereddict

class Graph(networkx.DiGraph):

def __init__(self, data=None, **attr):

networkx.DiGraph.__init__(self, data, **attr)

# Line #202 - 216 ; networkx/classes/digraph.py

self.graph = _ordereddict.OrderedDict() # dictionary for graph attributes

self.node = _ordereddict.OrderedDict() # dictionary for node attributes

# We store two adjacency lists:

# the predecessors of node n are stored in the dict self.pred

# the successors of node n are stored in the dict self.succ=self.adj

self.adj = _ordereddict.OrderedDict() # empty adjacency dictionary

self.pred = _ordereddict.OrderedDict() # predecessor

self.succ = self.adj # successor

# attempt to load graph with data

if data is not None:

networkx.convert.to_networkx_graph(data, create_using=self)

# load graph attributes (must be after convert)

self.graph.update(attr)

self.edge = self.adj