1.6 Glossary

1. graph: A network of vertexes which are connected by edges.
2. vertex: A point or object in a graph which may be connected to other vertexes.
3. edge: A connection between one or more vertexes in a graph.
4. torus: A donut shaped object
5. toroid: An object with a hole through it.
6. n-toroid: An object with n holes through it.
7. tree: A type of graphs without loops.
8. loop: A feature of a graph that the edges are connected together in such a way that you can find a path from a vertex back to that vertex without crossing the same edge twice.
9. graph-like: An object who’s shape reminds me of a graph.
10. tree-like: An object who’s shape reminds me of a tree (in the mathematical sense).
11. path: The list of edges one has to go down in order to get from one vertex to another.
12. path redundancy: When there are multiple paths between one vertex and another.
13. discrete The parts of an object are discrete when the boundaries between them are clearly defined.
14. continuous The parts of an object are continuous when no clear and precise boundaries can be drawn between them.
15. ablation When a part of an object is removed, rubbed, scraped, washed away.
16. growth When the outside of an object gets bigger over time by way of new material being added.