tra·verse

(trə-vûrs′, trăv′ərs)

v. tra·versed, tra·vers·ing, tra·vers·es

v.tr.

a. To travel or pass across, over, or through: a ship traversing a channel; light traversing a window.

b. To move to and fro over; cross and recross: traversed the room in thought for an hour.

c. To go up, down, or across (a slope) diagonally, as in skiing.

2. To cause to move laterally on a pivot; swivel: traverse an artillery piece.

3. To extend across; cross: a bridge that traverses a river.

4. To look over carefully; examine: "Someday I plan to read the classics. Someday I plan to traverse their pages and see for myself what raw weight they wield" (Beck Hansen).

5. Archaic To go counter to; thwart.

6. Law

a. To deny formally (an allegation of fact by the opposing party) in a lawsuit.

b. To join issue upon (an indictment).

7. To survey by traverse.

8. Nautical To brace (a yard) fore and aft.

v.intr.

1. To move to the side or back and forth.

2. To turn laterally; swivel.

a. To go up, down, or across a slope diagonally or in a zigzag manner, as in skiing.

b. To slide one's blade with pressure toward the hilt of the opponent's foil in fencing.

n. trav·erse (trăv′ərs, trə-vûrs′)

1. A passing across, over, or through.

2. A route or path across or over.

3. Something that lies across, especially:

a. An intersecting line; a transversal.

b. Architecture A structural crosspiece; a transom.

c. A gallery, deck, or loft crossing from one side of a building to the other.

d. A railing, curtain, screen, or similar barrier.

e. A defensive barrier across a rampart or trench, as a bank of earth thrown up to protect against enfilade fire.

4. Something that obstructs and thwarts; an obstacle.

5. Nautical The zigzag route of a vessel forced by contrary winds to sail on different courses.

6. A zigzag or diagonal course on a steep slope, as in skiing.

a. A lateral movement, as of a lathe tool across a piece of wood.

b. A part of a mechanism that moves in this manner.

c. The lateral swivel of a mounted gun.

8. A line established by sighting in surveying a tract of land.

9. Law A formal denial of the opposing party's allegation of fact in a lawsuit.

adj. trav·erse (trăv′ərs, trə-vûrs′)

Lying or extending across; transverse.

[Middle English traversen, from Old French traverser, from Vulgar Latin *trāversāre, from Late Latin trānsversāre, from Latin trānsversus, transverse; see transverse.]

tra·vers′a·ble adj.

tra·vers′al n.

tra·vers′er n.

American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.

ThesaurusAntonymsRelated WordsSynonymsLegend:

Noun	1.	traversal - taking a zigzag path on skis traverse crossing - traveling across skiing - a sport in which participants must travel on skis
	2.	traversal - travel across traverse travel, traveling, travelling - the act of going from one place to another; "he enjoyed selling but he hated the travel"

traversal

noun

Law. A refusal to grant the truth of a statement or charge:

contradiction, denial, disaffirmance, disaffirmation, disclaimer, negation, rejection.

Mentioned in

References in periodicals archive

Combining the minimum spanning tree traversal rule with quasi-randomized network coding mechanism, In QRNCDS algorithm, source packets are distributed stored on all network nodes with minimum energy consumption.

A Novel Redundant Data Storage Algorithm Based on Minimum Spanning Tree and Quasi-randomized Matrix

Since some of the binary tree traversal sequences can uniquely determine a binary tree (Knuth, 1973; Tang, 2001, 2010, 2011; Makinen, 2000), if there was only one binary tree to encrypt/decrypt, it was easy to be attacked.

A complex recursive algorithm for the lexicographic sequence of binary trees with n nodes

But in the existing system storage of values into index table are performed by signature tree traversal which causes time complexity.

Optimal packet classification techniques for performance enhancement and intrusion detection

The Depth First Search algorithm shares the similar mode for Goal identification and Search Tree traversal, but not in its motion of expansion.

Experimental comparison of uninformed and heuristic AI algorithms for N Puzzle and 8 Queen puzzle solution

If a node with [D.sub.i] < R is found, the tree traversal is resumed with a forward iteration.

Fully pipelined implementation of tree-search algorithms for vector precoding

Data output is executed in parallel with tree traversal using the second port of the output memories.

Acceleration of recursive data sorting over tree-based structures/Pasikartojanciu duomenu rusiavimo paspartinimas duomenu masyvuose

In a couple of related work on data gathering trees: (i) we have developed an energy-aware maximal leaf nodes based data gathering algorithm [9] wherein we attempt to minimize the number of intermediate nodes and maximize the number of leaf nodes so that the number of data aggregation points can be reduced; (ii) we formed the PEGASIS chain using tree traversal algorithms rather than the distance-based greedy heuristic used in this paper and the original PEGAIS algorithm.

Grid block energy based data gathering algorithms for wireless sensor networks

This tree traversal allows the librarian to use broad MeSH terms when associating headings with resource recommendations and keeps the MeSH-toresource maps manageable in size and complexity.

SmartSearch: automated recommendations using librarian expertise and the National Center for Biotechnology Information's Entrez Programming Utilities

Initially false, turned true when visited // starting from the given structure v, through in order traversal, algorithm visits all the descendant nodes in the ST-tree and augments the d_list begin if ST-outd(v) <> 0 then begin starting from v, in order traversal through ST-tree returns all the descendants of v in ST-tree; descendants obtained by the tree traversal are added to d_list; end; if nst(v) = true and NST-outd(v) <> 0 then begin starting from v, in order traversal through NST-tree returns all the descendants of v in ST-tree; descendants obtained by the tree traversal are added to d_list; end; Returns d_list as the list of descendants for structure v; end;

Complex query processing on Web graph: a social network perspective