← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tsort.py

  • Committer: Canonical.com Patch Queue Manager
  • Date: 2007-05-10 05:55:01 UTC
  • mfrom: (2481.1.5 roadmap)
  • Revision ID: pqm@pqm.ubuntu.com-20070510055501-w262sk5hl33vmd19
(robertc) Move HACKING to doc/developers/HACKING and start on performance analysis documentation. (Robert Collins)

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tsort.py
61
61
        """
62
62
        # a dict of the graph.
63
63
        self._graph = dict(graph)
64
 
        self._visitable = set(self._graph)
65
64
        ### if debugging:
66
65
        # self._original_graph = dict(graph)
67
66
        
121
120
                            # this parent was completed by a child on the
122
121
                            # call stack. skip it.
123
122
                            continue
124
 
                        if next_node_name not in self._visitable:
125
 
                            continue
126
123
                        # otherwise transfer it from the source graph into the
127
124
                        # top of the current depth first search stack.
128
125
                        try: