Undirected

Equivalently, a forest is an undirected acyclic graph.

For undirected rounding when halfway between two integers the even integer is chosen.

Halin graphs A Halin graph is a graph formed from an undirected plane tree (with no degree-two nodes) by connecting its leaves into a cycle, in the order given by the plane embedding of the tree.

His private studies were undirected.

If one views it as a (undirected) graph it is connected.

If the line is undirected, as it is for a real scalar field, then M(l) can go from N(v') to N(v) too.

It is defined here for undirected graphs; for directed graphs the definition of path requires that consecutive vertices be connected by an appropriate directed edge.

Simply represent the game by an undirected graph, the nodes being distributions of disks and the edges being moves and use breadth first search to find one (or all) shortest path(s) moving a tower from one peg onto another one.

Some evolutionary biologists, on the other hand, view it as an undirected emergent property of the ecosystem: as each individual species pursues its own self-interest, their combined actions tend to have counterbalancing effects on environmental change.

The algorithm suggested by Gallager, Humblet, and Spira citation for general undirected graphs has had a strong impact on the design of distributed algorithms in general, and won the Dijkstra Prize for an influential paper in distributed computing.

The set of regions of a map can be represented more abstractly as an undirected graph that has a vertex for each region and an edge for every pair of regions that share a boundary segment.