> Graphs, for example, can have cycles while trees can't. A cycle means that there is only one way to go to a node by following relationships from another node.
Typo here, that's the opposite of what cycle means, isn't it?
Typo here, that's the opposite of what cycle means, isn't it?
The article then continues with:
> To fully utilize the power of graphs, you first need to get a basic understanding of the underlying concepts in graph theory.
Indeed. ;)
> There are four components that every graph consists of nodes, relationships, labels, and properties.
This is incorrect. A graph in the graph-theoric sense consists solely of vertices and edges [0] (nodes and relationships), no labels or properties required. Also, there's a colon missing after "of".
The writing is quite sloppy for a field that requires rigorous precision.
[0] https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)#G...
A cycle is a path from a node back to itself that does not traverse any edge more than once.
You can have a directed acyclic graph (DAG) where there are multiple paths from one node to another, but there is no way to revisit a node once you have moved on.