Search results

• Denotative
  data Tree a = Node a [Tree a] dfs :: Graph -> [Vertex] -> [Tree Vertex]
  4 KB (490 words) - 12:00, 24 May 2024
• Show and Read instance
  .../pipermail/glasgow-haskell-users/2003-August/005586.html Show instance for Tree]
  744 bytes (109 words) - 14:32, 13 November 2006
• 99 questions/54A to 60
  A binary tree is either empty or it is composed of a root element and two successors, whi data Tree a = Empty | Branch a (Tree a) (Tree a)
  9 KB (1,368 words) - 02:54, 11 June 2023
• Himerge/En
  ...]] || ''sync'' || Update our portage tree or overlay with latest available tree on the mirrors.
  2 KB (296 words) - 07:54, 18 February 2008
• GeBoP
  ...s a brain viewer which enables you to explore the computer's internal game tree. To see the game tree, select <i>Brain</i> -> <i>Open</i>.
  1 KB (231 words) - 13:25, 16 March 2018
• 99 questions/Solutions/70
  (**) Tree construction from a node string. ...of its nodes, a special character ^ has been inserted whenever, during the tree traversal, the move is a backtrack to the previous level.
  7 KB (1,025 words) - 02:14, 23 July 2021
• Benchmarks Game/Parallel/BinaryTrees
  -- an artificially strict tree. data Tree = Nil | Node !Int !Tree !Tree
  6 KB (1,055 words) - 23:27, 18 April 2020
• Yhc/Options
  --parse show syntax tree after parser (default=off) --rename show syntax tree after rename (default=off)
  6 KB (733 words) - 15:19, 6 February 2021
• HaskLS
  * <bourbaki> boegel the idea is that ... ie think of the first think of the tree the root ...branches of changeing textures like makeing the bark darker where the tree is older or so
  3 KB (482 words) - 05:24, 30 November 2006
• Haskell Quiz/TicTacToe
  ...e player which learns to play the game by observing the game (i.e. no game tree traversal to find the optimal move).
  331 bytes (51 words) - 14:20, 23 August 2012
• Action
  data Tree a = Node a [Tree a] dfs :: Graph -> [Vertex] -> [Tree Vertex]
  3 KB (428 words) - 04:08, 12 April 2024
• 99 questions/Solutions/61
  Count the leaves of a binary tree
  331 bytes (43 words) - 13:38, 25 December 2016
• Blog articles/FFI
  * [http://therning.org/magnus/archives/238 C and Haskell sitting in a tree]
  737 bytes (93 words) - 01:56, 10 December 2020
• Circular programming
  Let us see the tree minimum problem (described above), and let us modularize the magic circular repmin :: Ord a => Tree a -> Tree a
  12 KB (1,607 words) - 10:48, 12 February 2010
• 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
• 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

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