glossary_definitions_notations

**Graph** A *graph* is denoted as with *nodes* or *vertices $V$, and *edges* $E$.
Edge An *edge

Unless otherwise stated, definitions apply to either directed or undirected graphs (with slight modifications).

**Neighbor** A node is a *neighbor* of a node exactly when , that is when and are connected by an edge. The set of neighbors of a node is denoted as

or for sake of simplicity.

**Path** A *path* is a sequence of edges that shares endpoints

with , .

**Cycle / Circuit** When the start and end node of a path coincide, , the path is called a *cycle*. When is directed, the name *circuit* is sometimes preferred.

/net/html/perso/melancon/Visual_Analytics_Course/data/pages/glossary_definitions_notations.txt · Last modified: 2016/05/07 21:47 by melancon