Glossary
Here we have collected some of the technical terms used within the book. For those terms referring to graph theory, Appendix A provides a short but comprehensive introduction to the field.
acyclic graph: An acyclic graph is a graph without any cycle.
adjacent nodes: Two nodes are said to be adjacent when they are linked by an arc or an edge.
ancestor: An ancestor of a node is a node that precedes it within a directed path and therefore in the topological ordering of the graph.
arc: An arc is a directed link between two nodes, usually assumed to be distinct. Nodes linked by an arc have a direct parent-child relationship: the node on the tail of the arc is the parent node, the node on the head of the arc is the child node. A node can ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access