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 ]
- group - a subgraph
- name - unique name of a nodeor group.edgesandgraphsdo not have a name.
- label - text that is displayed for node,group,graphoredge. For nodes, if not set, the nodenamewill be used instead.
- title - text displayed when you move the mouse over the node,edgeetc.
- port - each spot on a nodewhere oneedgecan start or end
- cell - one cell in the layout plane (which looks like a checker board)
- path - needs to be found to connect two nodesin alayout
- (edge) piece - each pathcan consist of more than onecelland each of these will contain on piece of theedge
- 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 nodesandedgesof a graph
- hinting - giving the layouter hints on how to generate a specific layout
- A* - (read: A-star) general algorithm to find a path