Graph::Easy - Manual - Glossary

# Graph::Easy - Manual

## Glossary

### Terminology

Here is a short list of terms that will be used throughout the manual:

- node - a node or vertex in a graph like [ Bonn ]
- edge - an edge connects two `nodes` (or one node with itself) like in [ Bonn ] -> [ Berlin ]
- name - unique name of a `node` or groupp. `edges` and `graphs` do not have a name.
- label - text that is displayed for `node`, `group`, `graph` or `edge`. For nodes, if not set, the node `name` will be used instead.
- title - text displayed when you move the mouse over the `node`, `edge` etc.
- port - each spot on a `node` where one `edge` can start or end
- cell - one cell in the layout (which looks like a checker board)
- path - needs to be found to connect two `nodes` in a `layout`
- (edge) piece - each `path` can consist of more than one `cell` and each of these will contain on piece of the `edge`
- layout - a physical representation of a graph (typical in a 2D plane)
- Parser - parses graphs from a textual description and turns them into an internal representation
- Layouter - lays out the `nodes` and `edges` of a graph
- hinting - giving the layouter hints on how to generate a specific layout
- A* - general algorithm to find a `path`