Open marco-foscato opened 2 years ago
In many case the getEdgeToParent is just the result of knowing that there can be only one connected vertex. For example, when getting the parent vertex of capping or ring-closing vertexes.
Even if in an undirected graph it would be possible to define rings of vertexes without the need of ring-closing vertexes, the latter save us from the possibility of having multiple edged between vertexes (i.e., a ring involving only 2 vertexes) and loops (i.e., a vertex connected with itself: a ring involving only one vertex). These two features are not to be excluded in general because if the APs involved in the formation of the edges are located on different and disconnected atoms (disconnected even if the two atoms belong to different vertexes), then the multiple edge is a ring involving atoms that belong to different vertexes, and the loop is just a new ring involving only atoms that belong to the single vertex.
Speculative thread on the possibility to make the graph undirected. It is at all possible? Some notes and comments on this possibility: