adjacency

  • 91Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …

    Википедия

  • 92Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …

    Википедия

  • 93Circulant graph — The Paley graph of order 13, an example of a circulant graph. Crown graphs …

    Wikipedia

  • 94Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …

    Wikipedia

  • 95Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or …

    Wikipedia

  • 96nearness — I (New American Roget s College Thesaurus) Proximity without touching Nouns 1. nearness, closeness, proximity, propinquity, apposition, approximation, vicinity, neighborhood, adjacency; approach, convergence; likeness, similarity. See futurity. 2 …

    English dictionary for students

  • 97contiguousness — noun the attribute of being so near as to be touching • Syn: ↑adjacency, ↑contiguity • Derivationally related forms: ↑contiguous, ↑contiguous (for: ↑contiguity), ↑adjacent ( …

    Useful english dictionary

  • 98ad|ja|cence — «uh JAY suhns», noun. = adjacency. (Cf. ↑adjacency) …

    Useful english dictionary

  • 99Expander graph — In combinatorics, an expander graph is a sparse graph which has high connectivity properties, quantified using vertex or edge expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several …

    Wikipedia

  • 100Priority queue — A priority queue is an abstract data type in computer programming. It is exactly like a regular queue or stack data structure, but additionally, each element is associated with a priority . stack: elements are pulled in last in first out order (e …

    Wikipedia