Skip to content
Snippets Groups Projects
Commit 2485d57f authored by Bob Lantz's avatar Bob Lantz
Browse files

Edits to pass code check and make style consistent.

parent 65c35b65
No related branches found
No related tags found
No related merge requests found
......@@ -290,8 +290,8 @@ def config( self, bw=None, delay=None, jitter=None, loss=None,
cmds += bwcmds
# Delay/jitter/loss/max_queue_size using netem
delaycmds, parent = self.delayCmds( delay=delay, jitter=jitter, loss=loss,
max_queue_size=max_queue_size,
delaycmds, parent = self.delayCmds( delay=delay, jitter=jitter,
loss=loss, max_queue_size=max_queue_size,
parent=parent )
cmds += delaycmds
......
......@@ -13,28 +13,33 @@
from mininet.util import irange, natural, naturalSeq
class Graph(object):
"Utility class to track nodes and edges "
class Graph( object ):
"Utility class to track nodes and edges - replaces networkx.Graph"
def __init__(self):
def __init__( self ):
self.data = {}
def add_node(self,node):
def add_node( self, node ):
"Add node to graph"
if node not in self.data.keys():
self.data[node] = []
self.data[ node ] = []
def add_edge(self,src,dest):
self.add_node(src)
self.add_node(dest)
self.data[src].append(dest)
def add_edge( self, src, dest ):
"Add edge to graph"
self.add_node( src )
self.add_node( dest )
self.data[ src ].append( dest )
def nodes(self):
def nodes( self ):
"Return list of graph nodes"
return self.data.keys()
def edges(self):
def edges( self ):
"Iterator: return graph edges"
for src in self.data.keys():
for dest in self.data[src]:
yield (src,dest)
for dest in self.data[ src ]:
yield ( src, dest )
class Topo(object):
"Data center network representation for structured multi-trees."
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment