Search Results for ""

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

A fast boat is overtaking a slower one when fog suddenly sets in. At this point, the boat being pursued changes course, but not speed, and proceeds straight in a new ...

The circumcircle is a triangle's circumscribed circle, i.e., the unique circle that passes through each of the triangle's three vertices. The center O of the circumcircle is ...

The diameter of a circle is the distance from a point on the circle to a point pi radians away, and is the maximum distance from one point on a circle to another. The ...

The Tucker circles are a generalization of the cosine circle and first Lemoine circle which can be viewed as a family of circles obtained by parallel displacing sides of the ...

Given two curves C_1 and C_2 and a fixed point O, let a line from O cut C_1 at Q and C_2 at R. Then the locus of a point P such that OP=QR is the cissoid. The word cissoid ...