I need a valid data structure to group these. I need a tree-like graph, but one that allows multiple child nodes A special tree of parent nodes.
While thinking about this problem, I realized that Wikipedia is an imperfect model. In fact, their hierarchical structure is basically what I need from here. I saw that they use Directed graph, but I want to know what are the differences/disadvantages between this directed graph, directed acyclic graph and multi-tree. I tried to research it, but I don’t quite understand the differences. Any help would be greatly appreciated. Thanks!
< p>> A directed graph is a set of nodes connected by edges, which have directions associated with them.
> A directed acyclic graph is a directed graph without directed cycles
> polytree is a directed graph, There is at most one undirected path between any two vertices. In other words, polytree is a directed acyclic graph, and there is no undirected cycle in it.
So I think you search for connected, directed, Acyclic graphs. Although the Wikipedia category system allows cycles, they are not needed.
I am currently developing an ontology, one for all categories (thinking people, places, Things) Web hierarchy. The finished product should be something that allows me to navigate from Technology-> Computers-> Laptops-> USB Ports, and also from Movies-> Minority Report-> Computers-> etc.
I need a valid one Data structure to group these. I need a tree-like graph, but a special tree that allows child nodes to have multiple parent nodes.
When thinking about this, I realized that Wikipedia is an imperfect model. In fact, their hierarchical structure is basically what I need from here. I saw that they use directed graphs, but I want to know the difference/disadvantages between this directed graph, directed acyclic graph and multi-tree What is it. I tried researching it, but I don’t quite understand the differences. Any help would be greatly appreciated. Thanks!
I think the article on Wikipedia gives a good overview:
> A directed graph is one connected by edges Group nodes, which have directions associated with them.
> A directed acyclic graph is a directed graph without directed cycles
> polytree is a directed graph, and there is at most one undirected graph between any two vertices Path. In other words, polytree is a directed acyclic graph, and there is no undirected cycle in it.
So I think you search for connected, directed, acyclic graphs. Although the Wikipedia category system allows cycles, But they are not needed.