It returns 2 matches: "aaa" and "bbb". However, what I'd like to get instead is 2 paths that point to the matches, i.e.,:
- $.that[0]
- $.nested.deep
Can this be accomplished using means that are available out of the box? If not, what would be a sane way of implementing it?
1. Not that I can see documented.
2a See if some other language that has a PL extension for PostgreSQL can do this more easily and write a function in the language.
2b Create a custom C language function based off of one of the existing "path exists" functions that keeps track of its position in the graph and the returns that instead of a boolean/whatever.
2c Create your own procedural code, which can be done in pl/pgsql, that performs the graph traversal and captures the data like in 2b.
