dfs -package:algebraic-graphs

A spanning forest of the part of the graph reachable from the listed vertices, obtained from a depth-first search of the graph starting at each of the listed vertices in order.

Depth-first search.

dfs next found initial performs a depth-first search over a set of states, starting with initial and generating neighboring states with next. It returns a depth-first path to a state for which found returns True. Returns Nothing if no path is possible.

Example: Simple directed graph search

>>> import qualified Data.Map as Map

>>> graph = Map.fromList [(1, [2, 3]), (2, [4]), (3, [4]), (4, [])]

>>> dfs (graph Map.!) (== 4) 1
Just [3,4]

Iterate a tree in DFS pre-order. (Depth First Search)

Depth-first paths starting at a vertex.

>>> runG example $ \g@G{..} -> fmap3 gFromVertex $ dfs g <$> gToVertex 'x'
Right (Just ["xde","xe"])

Depth-first search algorithms. Names consist of:

1. An optional direction parameter, specifying which nodes to visit next.

• u undirectional: ignore edge direction
• r reversed: walk edges in reverse
• x user defined: speciy which paths to follow

1. "df" for depth-first
2. A structure parameter, specifying the type of the result.
   • s Flat list of results
   • f Structured Tree of results
3. An optional "With", which instead of putting the found nodes directly into the result, adds the result of a computation on them into it.
4. An optional prime character, in which case all nodes of the graph will be visited, instead of a user-given subset.

DFS implementation of MonadSearch.

Apply a Pattern transformation function depth first.

Monadic graph algorithms are defined in two steps:

1. define the (possibly parameterized) graph transformer (e.g., dfsGT)
2. run the graph transformer (applied to arguments) (e.g., dfsM)

depth-first search yielding number of nodes

depth-first-search vertices starting at a particular vertex

dfsM is a monadic version of dfs: it has support for monadic next and found parameters.

Not on Stackage, so not searched. Build Debian From Scratch CD/DVD images

The type of the deobfuscation file.

The day of the month the feed file should be fetched (1-31).

The URL where the feed file can be fetched. Google Merchant Center will support automatic scheduled uploads using the HTTP, HTTPS, FTP, or SFTP protocols, so the value will need to be a valid link using one of those four protocols.

The hour of the day the feed file should be fetched (0-23).

The minute of the hour the feed file should be fetched (0-59). Read-only.