英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

bipartite    
a. 由两部组成的,有两分的,裂开为二的

由两部组成的,有两分的,裂开为二的

bipartite
adj 1: divided into two portions almost to the base
2: involving two parts or elements; "a bipartite document"; "a
two-way treaty" [synonym: {bipartite}, {two-part}, {two-way}]

Bipartite \Bip"ar*tite\, a. [L. bipartitus, p. p. of bipartire;
bis twice partire. See {Partite}.]
1. Being in two parts; having two correspondent parts, as a
legal contract or writing, one for each party; shared by
two; as, a bipartite treaty.
[1913 Webster]

2. Divided into two parts almost to the base, as a leaf;
consisting of two parts or subdivisions. --Gray.
[1913 Webster]

49 Moby Thesaurus words for "bipartite":
apart, asunder, biaxial, bicameral, bicuspid, bifid, biform,
bifurcated, bilateral, binocular, binomial, binominal, bipartisan,
biped, bipetalous, bipinnate, bisexual, bivalent, dichotomous,
discontinuous, discrete, distinct, divergent, double, duadic, dual,
dualistic, duplex, duplicated, dyadic, identical, in two,
incoherent, insular, matched, noncohesive, partitioned, separate,
twain, twin, twinned, two, two-sided, unassociated, unattached,
unattended, unconnected, unibivalent, unjoined


请选择你想看的字典辞典：
单词字典翻译
bipartite查看　bipartite　在百度字典中的解释百度英翻中〔查看〕
bipartite查看　bipartite　在Google字典中的解释Google英翻中〔查看〕
bipartite查看　bipartite　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • Implement Trie (Prefix Tree) - LeetCode
    A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings There are various applications of this data structure, such as autocomplete and spellchecker
  • Trie Data Structure in Java - GeeksforGeeks
    A Trie Data Structure is nothing but it is a tree-like data structure which is used to efficiently store and retrieve the dynamic set of Strings or Keys It is certainly used for tasks that will involve searching for strings with common prefix like auto-complete or spell-checking applications In this article, we will learn about Trie Data Structure Implementation in Java Organization of a Trie Data Structure In a Trie, each node represents the single character of the string The structure
  • Trie Data Structure in Java | Baeldung
    A trie (also known as a digital tree) and sometimes even radix tree or prefix tree (as they can be searched by prefixes), is an ordered tree structure, which takes advantage of the keys that it stores – usually strings
  • Building and Using a Trie in Java: An In-Depth Guide
    This tutorial will guide you through the process of creating and using a Trie (prefix tree) in Java, a powerful data structure often used for search operations in dictionaries, autocomplete systems, and text processing applications
  • Trie (Prefix Tree) Data Structure – Complete Guide with Java Code . . .
    A Trie (pronounced "try") is a special tree-like data structure used to efficiently store and retrieve keys in a dataset of strings It is especially useful for dictionary, autocomplete, and prefix search problems
  • Trie (Prefix Tree) Implementation in Java – Learn Programming
    A Trie, also known as a prefix tree, is a tree-like data structure that is used to store a dynamic set of strings, where the keys are usually strings Tries are particularly useful for tasks like autocomplete, spell-checking, and IP routing
  • Trie in Java | Trie Program in Java - Sanfoundry
    Trie is a tree-like data structure used for efficient string storage and searching It is also known as a prefix tree Unlike a binary search tree, no node in the tree stores the key associated with that node, instead, its position in the tree defines the key with which it is associated
  • Implement Trie (Prefix Tree) - Java Solution - Source Code Examples
    In this post, we'll explore how to implement a Trie, also known as a Prefix Tree A Trie is a specialized tree-like data structure that is particularly useful for managing a dynamic set of strings where keys are usually strings Common applications include autocomplete systems and spell checkers
  • Tutorial: Trie Data Structure in Java - Squash
    Here's an example of creating and traversing a binary tree: A trie, also known as a prefix tree, is a specialized tree data structure that is particularly useful for efficient string search operations It is commonly used in applications like autocomplete, spell checkers, and IP routing tables





中文字典-英文字典  2005-2009