Find all Trival Paths for a tree in GraphMatrix.hpp

[ash01825]

If the graph is Acyclic then it's a tree then a function which returns a vector of all it's Trival Paths

[SharonIV0x86]

If the graph is Acyclic then it's a tree then a function which returns a vector of all it's Trival Paths

What do you mean by trivial? a path that consists of only one vertex and no edges? And how do you plan to implement it?

[ash01825]

the point is to include all paths in a tree from all points like it's a typical tree question that I encountered in competitive programming and it has its application in problem solving so like it will literally include all paths