3 ms·
> 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.
by vehementi 4y ago
> 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?
- pfisherman 4y agoThat’s actually a tree. 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.
- vpavicic 4y agoThank you for noticing! I'll investigate this error and fix it accordingly ;)
- layer8 4y agoIt’s not even the opposite. As the sibling says, this can happen in DAGs, but not in trees (both of which are cycle-free). This indicates such a confused understanding of graphs that it gives me very low confidence in the article (and the product). 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)#Graph https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)#G...