Search results

Create the page "Distinguish" on this wiki! See also the search results found.

• Depth-first search
  In an undirected graph, preorder numbers may be used to distinguish between down edges and back edges. (It becomes obvious when an edge is a tr
  17 KB (2,930 words) - 00:28, 3 March 2012
• Longest palindromic substring
  {{Distinguish|Longest palindromic subsequence}}
  19 KB (3,066 words) - 10:05, 1 November 2016
• Longest palindromic subsequence
  {{Distinguish|Longest palindromic substring}}
  9 KB (1,529 words) - 01:10, 3 May 2022
• String
  ...esentations of all valid English words. (Note that we have been careful to distinguish the words themselves from their representations as strings.) Then ''ther''
  12 KB (1,959 words) - 23:56, 23 November 2011
• Longest common subsequence
  {{Distinguish|Longest common substring}}
  17 KB (2,927 words) - 05:07, 31 May 2011
• Graph theory
  ...ertices names, or ''labels'' (often non-negative integers), so that we can distinguish them and remember which vertex is which. Often, to help visualize a problem
  25 KB (4,451 words) - 23:15, 19 October 2020
• Longest common substring
  {{Distinguish|Longest common subsequence}}
  7 KB (1,242 words) - 04:49, 29 May 2011
• Pointer
  ...ming languages. These ''disk pointers'' are usually referred to as such to distinguish them from pointers into primary storage and virtual memory, which are simpl
  17 KB (2,887 words) - 19:59, 1 August 2012
• Shunting yard algorithm
  ...he very beginning of the input. The algorithm must be modified in order to distinguish between the two.
  15 KB (2,569 words) - 19:07, 21 October 2015