File: topsort.py

package info (click to toggle)
brian 2.9.0-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 6,872 kB
  • sloc: python: 51,820; cpp: 2,033; makefile: 108; sh: 72
file content (15 lines) | stat: -rw-r--r-- 319 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 
from graphlib import TopologicalSorter

__all__ = ["topsort"]


def topsort(graph):
    """
    Topologically sort a graph

    The graph should be of the form ``{node: [list of nodes], ...}``.

    Uses `graphlib.TopologicalSorter`.
    """
    sorter = TopologicalSorter(graph)
    return list(sorter.static_order())