Did I find the right examples for you? yes no

All Samples(14)  |  Call(0)  |  Derive(0)  |  Import(14)
DFS.py

Algorithms for depth first search in Python.
We need to search iteratively rather than recursively in
order to avoid Python's low recursion limit.

D. Eppstein, July 2004.

src/p/y/pystream-HEAD/lib/PADS/StrongConnectivity.py   pystream(Download)
 
import unittest
import DFS
 
try:

src/p/y/pystream-HEAD/lib/PADS/Repetitivity.py   pystream(Download)
 
from StrongConnectivity import StronglyConnectedComponents
import DFS
 
try:

src/p/y/pystream-HEAD/lib/PADS/Medium.py   pystream(Download)
    from sets import Set as set
 
import BFS,DFS
from Graphs import isUndirected
import unittest

src/p/y/pystream-HEAD/lib/PADS/Bipartite.py   pystream(Download)
from Biconnectivity import BiconnectedComponents
import Graphs
import DFS
 
class NonBipartite(Exception):

src/p/y/pystream-HEAD/lib/PADS/Biconnectivity.py   pystream(Download)
from PartialOrder import TopologicalOrder
 
import DFS
 
disconnected = object() # flag for BiconnectedComponents

src/p/a/PADS-0.0.20131119/pads/StrongConnectivity.py   PADS(Download)
 
import unittest
import DFS
 
class StronglyConnectedComponents(DFS.Searcher):

src/p/a/PADS-0.0.20131119/pads/Repetitivity.py   PADS(Download)
 
from StrongConnectivity import StronglyConnectedComponents
import DFS
 
class NonrepetitiveGraph:

src/p/a/PADS-0.0.20131119/pads/Medium.py   PADS(Download)
"""
 
import BFS,DFS
from Graphs import isUndirected
import unittest

src/p/a/PADS-0.0.20131119/pads/Bipartite.py   PADS(Download)
from Biconnectivity import BiconnectedComponents
import Graphs
import DFS
 
class NonBipartite(Exception):

src/p/a/PADS-0.0.20131119/pads/Biconnectivity.py   PADS(Download)
from PartialOrder import TopologicalOrder
 
import DFS
 
disconnected = object() # flag for BiconnectedComponents