What is the difference (if any) between a node and a vertex? I can't find the answer after looking at countless sites! Even my book doesn't specify it so I am kind of lost!
It is worth mentioning that I am looking for the difference besides the fact that it is called a 'vertex' when used in a graph and a 'node' when used in a tree.
Elements of trees are called their nodes. The nodes without child nodes are called leaf nodes. A tree with 'n' vertices has 'n-1' edges. If it has one more edge extra than 'n-1', then the extra edge should obviously has to pair up with two vertices which leads to form a cycle.
Vertices in shapes are the points where two or more line segments or edges meet (like a corner). The singular of vertices is vertex. For example a cube has 8 vertices and a cone has one vertex. Vertices are sometimes called corners but when dealing with 2D and 3D shapes, the word vertices is preferred.
The nodes in a graph represent persons (or animals, organizations, cities, countries, etc) and the lines represent relationships among them. The line between persons a and b is represented mathematically like this: (a,b).
Vertices are used to define the shape and location of line and polygon feature representations. You can adjust the shape of line and polygon feature representations by moving, adding, or deleting vertices.
There are no differences between the words Node and Vertex. Even in some books that explain graph theory and graph algorithms they name it as:
Vertex denoted by v, and sometimes it's called nodes also
There are no major nor minor differences between them.
This is mentioned in the book: Data structure and Algorithms with Object Oriented Design Patterns in C#, Bruno R, Preiss.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With