I developed a border list model diagram in mysql. I found the same procedure at http://www.artfulsoftware.com/mysqlbook/sampler/mysqled1ch20.html to traverse the tree.
But I need a specific query that asked three random nodes that I will find out if they are part (subpath) of the descendant path in the general tree.
Could you help me? Thank you
You need to create a function "has_parent (this_node, look_for)" that recursively (i.e. by itself) queries the tree to solve the problem.
Source: https://habr.com/ru/post/1794484/More articles:Include JAR file in ant compilation - javatype required for function calls using a short data type variable as a parameter - javaCapturing exceptions caused by temporary network errors - javaC # / Winforms App freeze / lag - multithreadingCakephp Helpers in Views and $ this - standardshibernate - reduce the number of queries - javaЗапрос представления базы данных дерева (MySQL) - mysqlКак отправить JSON в Asp.NET Webservice? - jsonThe class of portable streams implemented in C ++ - c ++Get rid of busy waiting while executing asynchronous threads cuda - cudaAll Articles