<<Up     Contents

Edge

Redirected from Arc

In graph theory, a graph describes a set of connections between objects. Each object is called a vertex. Each connection goes between two vertices and is called an edge or arc.

A directed edge has a direction associated with it, so it is thought of as coming from one of the vertices and going to the other one. An undirected edge treats both vertices interchangeably.

Often, a real number is associated with each edge. These numbers are called weights.

wikipedia.org dumped 2003-03-17 with terodump