disconnected path
Смотреть что такое "disconnected path" в других словарях:
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Connected space — For other uses, see Connection (disambiguation). Connected and disconnected subspaces of R² The green space A at top is simply connected whereas the blue space B below is not connected … Wikipedia
Locally connected space — In this topological space, V is a neighbourhood of p and it contains a connected neighbourhood (the dark green disk) that contains p. In topology and other branches of mathematics, a topological space X is locally connected if every point admits… … Wikipedia
Connectedness — This article is about mathematics. For other uses, see Connectedness (disambiguation). In mathematics, connectedness is used to refer to various properties meaning, in some sense, all one piece . When a mathematical object has such a property, we … Wikipedia
Glossary of topology — This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Anomaly (physics) — In quantum physics an anomaly or quantum anomaly is the failure of a symmetry of a theory s classical action to be a symmetry of any regularization of the full quantum theory. In classical physics an anomaly is the failure of a symmetry to be… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
literature — /lit euhr euh cheuhr, choor , li treuh /, n. 1. writings in which expression and form, in connection with ideas of permanent and universal interest, are characteristic or essential features, as poetry, novels, history, biography, and essays. 2.… … Universalium
Topological property — In topology and related areas of mathematics a topological property or topological invariant is a property of a topological space which is invariant under homeomorphisms. That is, a property of spaces is a topological property if whenever a space … Wikipedia
Centrality — Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network … Wikipedia
