TOPICS
Search

Search Results for ""


351 - 360 of 1848 for Shortest path problemSearch Results
A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...
A topological space decomposes into its connected components. The connectedness relation between two pairs of points satisfies transitivity, i.e., if a∼b and b∼c then a∼c. ...
A space D is connected if any two points in D can be connected by a curve lying wholly within D. A space is 0-connected (a.k.a. pathwise-connected) if every map from a ...
Consider the length of the diagonal of a unit square as approximated by piecewise linear steps that may only be taken in the right and up directions. Obviously, the length so ...
A continuous transformation from one function to another. A homotopy between two functions f and g from a space X to a space Y is a continuous map G from X×[0,1]|->Y such ...
A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...
Consider a power series in a complex variable z g(z)=sum_(n=0)^inftya_nz^n (1) that is convergent within the open disk D:|z|<R. Convergence is limited to within D by the ...
A property that is always fulfilled by the product of topological spaces, if it is fulfilled by each single factor. Examples of productive properties are connectedness, and ...
The path traced out by a fixed point at a radius b>a, where a is the radius of a rolling circle, also sometimes called an extended cycloid. The prolate cycloid contains ...
A single-valued function is function that, for each point in the domain, has a unique value in the range. It is therefore one-to-one or many-to-one. A single-valued complex ...
1 ... 33|34|35|36|37|38|39 ... 185 Previous Next

...