Question: Can an edge of a hypergraph connect to some node more than once in some definition of a graph? If so you could represent a text, for example a book, as a single directed hyperedge running through a graph of words. EDIT: Probably not. If you could you’d lose lots of the useful properties of graphs, I think.
- herdrick posted this