mirror of
https://github.com/CumulusNetworks/ifupdown2.git
synced 2024-05-06 15:54:50 +00:00
615234a10d
Ticket: CM-2731 Reviewed By: Testing Done: Tested ifupdown sanity The graph module modifies the indegrees array and so introduce a copy of the dict before modifying it.
72 lines
1.8 KiB
Python
72 lines
1.8 KiB
Python
#!/usr/bin/python
|
|
#
|
|
# Copyright 2013. Cumulus Networks, Inc.
|
|
# Author: Roopa Prabhu, roopa@cumulusnetworks.com
|
|
#
|
|
# graph --
|
|
# graph helper module for ifupdown
|
|
#
|
|
|
|
import logging
|
|
import copy
|
|
from collections import deque
|
|
try:
|
|
from gvgen import *
|
|
except ImportError, e:
|
|
pass
|
|
|
|
class graph():
|
|
|
|
def __init__(self):
|
|
self.logger = logging.getLogger('ifupdown.' +
|
|
self.__class__.__name__)
|
|
|
|
@classmethod
|
|
def topological_sort_graphs_all(cls, dependency_graphs, indegrees_arg):
|
|
S = []
|
|
Q = deque()
|
|
|
|
indegrees = copy.deepcopy(indegrees_arg)
|
|
for ifname,indegree in indegrees.items():
|
|
if indegree == 0:
|
|
Q.append(ifname)
|
|
|
|
while len(Q):
|
|
# initialize queue
|
|
x = Q.popleft()
|
|
|
|
# Get dependents of x
|
|
dlist = dependency_graphs.get(x)
|
|
if not dlist:
|
|
S.append(x)
|
|
continue
|
|
|
|
for y in dlist:
|
|
indegrees[y] = indegrees.get(y) - 1
|
|
if indegrees.get(y) == 0:
|
|
Q.append(y)
|
|
|
|
S.append(x)
|
|
|
|
for ifname,indegree in indegrees.items():
|
|
if indegree != 0:
|
|
raise Exception('cycle found involving iface %s' %ifname +
|
|
' (indegree %d)' %indegree)
|
|
|
|
return S
|
|
|
|
@classmethod
|
|
def generate_dots(cls, dependency_graph, indegrees):
|
|
gvgraph = GvGen()
|
|
graphnodes = {}
|
|
for v in dependency_graph.keys():
|
|
graphnodes[v] = gvgraph.newItem(v)
|
|
|
|
for i, v in graphnodes.items():
|
|
dlist = dependency_graph.get(i, [])
|
|
if not dlist:
|
|
continue
|
|
for d in dlist:
|
|
gvgraph.newLink(v, graphnodes.get(d))
|
|
gvgraph.dot()
|