-
1 δρόμος
δρόμος, ου, ὁ (Hom.+; loanw. in rabb.)① movement on a path from one point to another, course of heavenly bodies (Ps.-Pla., Axioch. 370b; Dio Chrys. 19 [36], 42; Sext. Emp., Math. 9, 27; M. Ant. 7, 47; Herm. Wr. 4, 8 a1.; PGM 12, 251; 13, 575; Jos., Ant. 1, 32; Mel., Tat.) Dg 7:2. τὸν δ. διανύειν complete or continue their course 1 Cl 20:2.—πάντα … τῷ δρόμῳ αὐτῶν ἀπηλαύνοντο everything returned to its course GJs 18:3 (Tdf., Ea p. 35, 4f after codd., not pap; ὑπὸ τοῦ δρόμου αὐτῶν ἀπηλαύνετο deStrycker). Of a race, in a fig. context (Philo, Leg. All. 3, 48) 2 Ti 4:7 (s. τελέω 1 beg.); of martyrs ἐπὶ τὸν τῆς πίστεως βέβαιον δ. κατήντησαν they securely reached the goal in the race of faith 1 Cl 6:2. GMary 463, 1.② carrying out of an obligation or task, course of life, mission, fig. ext. of 1 πληροῦν τὸν δ. complete one’s course Ac 13:25; τελεῖν finish Ac 20:24. προστιθέναι τῷ δ. hasten on in your course IPol 1:2 (s. JKleist, transl., ’46, note ad loc.).—DELG s.v. δραμεῖν. M-M. TW.
См. также в других словарях:
Path dependence — explains how the set of decisions one faces for any given circumstance is limited by the decisions one has made in the past, even though past circumstances may no longer be relevant. [Definition from [http://poopthebook.com/blog/?p=20 Our Love Of … Wikipedia
Path MTU discovery — (PMTUD) is a technique in computing for determining the maximum transmission unit (MTU) size on the network path between two IP hosts with a view to avoiding IP fragmentation. Path MTU discovery works by setting the DF (Don t Fragment) option bit … Wikipedia
Complete androgen insensitivity syndrome — Classification and external resources AIS results when the function of the androgen receptor (AR) is impaired. The AR protein (pictured) mediates the effects of androgens in the human body. ICD 10 … Wikipedia
Complete bipartite graph — A complete bipartite graph with m = 5 and n = 3 Vertices n + m Edges mn … Wikipedia
Path cover — Given a directed graph G = (V, E), a path cover is a set of directed paths such that every vertex v ∈ V belongs to at least one path. Note that a path cover may include paths of length 0 (a single vertex).[1] A path cover … Wikipedia
path — Synonyms and related words: air lane, air line, air route, airway, alameda, approach, artery, avenue, beat, beaten path, beaten track, berm, bicycle path, boardwalk, boulevard, break, bridle path, broken circuit, catwalk, channel, circuit,… … Moby Thesaurus
Path graph — infobox graph name = Path graph image caption = A path graph vertices = n edges = n 1 automorphisms = 2 diameter = n 1 radius = ⌊n/2⌋ chromatic number = 2 chromatic index = 2 properties = Unit distance Bipartite graphIn the mathematical field of… … Wikipedia
Path Valley Railroad — The Path Valley Railroad was a proposed narrow gauge railroad in Perry and Franklin Counties, Pennsylvania.Intended as an extension of the Newport and Shermans Valley Railroad, it was to begin at that railroad s terminus in New Germantown and run … Wikipedia
path — The complete location of a directory or a file in the file system. Also called pathname or directory path. See also Universal Naming Convention … Dictionary of networking
Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
