/usr/lib/python2.7/dist-packages/traits/util/toposort.py is in python-traits 4.6.0-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 | #-----------------------------------------------------------------------------
#
# Copyright (c) 2011, Enthought, Inc.
# All rights reserved.
#
# This software is provided without warranty under the terms of the BSD
# license included in enthought/LICENSE.txt and may be redistributed only
# under the conditions described in the aforementioned license. The license
# is also available online at http://www.enthought.com/licenses/BSD.txt
# Thanks for using Enthought open source!
#
# Author: Enthought, Inc.
# Description: <Enthought util package component>
#
#-----------------------------------------------------------------------------
""" A simple topological sort on a dictionary graph.
"""
class CyclicGraph(Exception):
"""
Exception for cyclic graphs.
"""
def __init__(self):
Exception.__init__(self, "Graph is cyclic")
def topological_sort(graph):
"""
Returns the nodes in the graph in topological order.
"""
discovered = {}
explored = {}
order = []
def explore(node):
children = graph.get(node, [])
for child in children:
if child in explored:
pass
elif child in discovered:
raise CyclicGraph()
else:
discovered[child] = 1
explore(child)
explored[node] = 1
order.append(node)
for node in graph.keys():
if node not in explored:
explore(node)
order.reverse()
return order
|