jrgemignani commented on issue #1287: URL: https://github.com/apache/age/issues/1287#issuecomment-1804706376
@I33Buckler I'd be careful with StackOverflow answers that have few, if any, responses. That one, in particular, is not very helpful in my opinion. I feel the following **might** be of use, I don't know how much experience or expertise you have with graphs or your level of CS understanding, so please don't take offense if I repeat or state the obvious,... A graph in the context of Apache AGE is a computer science abstract data type -[https://en.wikipedia.org/wiki/Graph_(abstract_data_type)](https://en.wikipedia.org/wiki/Graph_(abstract_data_type)) Apache AGE specifically implements a digraph (directional graph) with labels and properties for each component. I'm going to give you the following links because, on the surface, it appears that what you are doing might fall into this category of problems. [https://en.wikipedia.org/wiki/Computational_complexity_theory ](https://en.wikipedia.org/wiki/Computational_complexity_theory) Specifically, ones like this. [https://en.wikipedia.org/wiki/Travelling_salesman_problem](https://en.wikipedia.org/wiki/Travelling_salesman_problem) If it does, you're going to need to carefully look at your desired result and possibly restrict it to make it more manageable. Again, I only have a general idea of what you are doing. Hope this is helpful. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: dev-unsubscr...@age.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org
