Search results

• 99 questions/Solutions/83
  Write a predicate s_tree(Graph,Tree) to construct (by backtracking) all spanning trees of a given graph. ...le subgraphs, then filters out those that meet the criteria for a spanning tree:
  2 KB (281 words) - 03:49, 10 January 2017
• Humor/Hugme
  ...stating that Functional Programming was devised by a, "... load of binary tree Huggers!".
  700 bytes (109 words) - 04:19, 25 January 2006
• Talk:Monads as containers
  ...those starting out with monads, it's probably helpful to actually have the Tree monad code, in case they want to "check their answer." Here it is: instance Monad Tree where
  7 KB (1,266 words) - 05:13, 15 October 2016
• 99 questions/61 to 69
  An example tree: <div style="border-bottom:1px solid #eee">Count the leaves of a binary tree. <span style="float:right"><small>[[99 questions/Solutions/61|Solutions]]</
  12 KB (1,696 words) - 05:35, 11 June 2023
• Hoed
  After running the program a computation tree is constructed and displayed in a web browser. ...f your program misbehaves, you can judge the computation statements in the tree as 'right' or 'wrong' according to your intention. When enough statements a
  6 KB (896 words) - 09:12, 22 December 2015
• 99 questions/Solutions/92
  Anyway the puzzle goes like this: Given a tree with N nodes (and hence N-1 edges). Find a way to enumerate the nodes from ...s a numbering scheme for a given tree. What is the solution for the larger tree pictured below?
  3 KB (420 words) - 22:52, 7 June 2017
• Generics
  data Tree a = Leaf | Bin a (Tree a) (Tree a) ...length of a tree (or its size, if you want), by recursively traversing the tree and counting the number of elements. Generic programming allows to define a
  4 KB (598 words) - 02:44, 13 February 2021
• Talk:Key-value apply
  ...because the case actually transforms the <hask>[([k],[v])]</hask> into a ''tree'' to facilitate faster searching.
  932 bytes (152 words) - 18:39, 16 February 2007
• Zipper
  rather than the data itself. For example, consider a simple binary tree type: data Tree a = Fork (Tree a) (Tree a) | Leaf a
  10 KB (1,623 words) - 21:10, 26 June 2023
• Phone number
  -- The dictionary is stored in a denary tree. A node has sub-trees, a leaf -- Given an existing tree, create a new tree to be its parent. Put the
  12 KB (1,746 words) - 05:55, 21 February 2010
• The Monad.Reader/Issue4/On Treaps And Randomization
  We give an example implementation of treaps (tree heaps) in Haskell. The emphasis is partly on treaps, partly on the System.R One such representation is the binary search tree (In much literature,
  17 KB (2,987 words) - 01:08, 10 May 2008
• Difference list
  Consider showing a binary tree. If the tree is large, you end up with a pretty large left association for the left subt
  3 KB (421 words) - 16:40, 1 August 2018
• Extending Phooey
  treeDisplay :: Sourceable a => Source (Tree a) -> UI (TreeSources a) aTree <- title "Family Tree" $ treeDisplay (liftA asTree db)
  3 KB (480 words) - 12:31, 18 August 2007
• New monads/MonadRandomSplittable
  The following constructs a tree of infinite depth and width: import Data.Tree
  4 KB (476 words) - 22:10, 27 November 2007
• Diagrams/Dev/BuildStatus
  ...ravis-ci.org/diagrams/dual-tree https://secure.travis-ci.org/diagrams/dual-tree.png]
  4 KB (510 words) - 01:42, 10 November 2013
• Zipper monad
  ...es a tree and returns the <hask>Loc</hask> corresponding to the top of the tree. Thus a typical call to <hask>traverse</hask> might look like: getStruct = modifyStruct id -- works because modifyTree returns the 'new' tree
  5 KB (846 words) - 01:00, 9 October 2006
• Output/Input
  ...tree [...] since any number of subtrees may be extracted from an infinite tree). In practice, these values will be determined at run time (when used as ar main' :: Tree Exterior -> ...
  8 KB (1,236 words) - 12:36, 1 January 2024
• Talk:HIDE
  ...ecific implementation of it. To be precise, hIDE should store Haskell in a tree structure (preferably XML) but provide enough functionality to let the prog ...does not advocate a top-down editor. Haskell source code do not have deep tree structure so this is desirable.
  3 KB (490 words) - 23:08, 18 January 2007
• 99 questions/Solutions/58
  An efficient solution, which takes the fact that a tree with an even number of nodes can't be symmetric into consideration:
  666 bytes (91 words) - 13:37, 25 December 2016
• HIDE/Design
  * Allows plugins to be built seperately or "out of tree" * TeX typesetting (Easier if you have syntax tree available)
  4 KB (632 words) - 19:45, 22 February 2008

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)