<font size=2 face="sans-serif">Hi Sylvain,</font><br><br><font size=2 face="sans-serif">Quick update:: I looked on issue 417
as we discussed on the phone but when I read the text I realized that it
would be more appropriate to open two new issues and not to piggyback on
this issue. I opened 427 to describe a defect in ShortestPathTo. Since
we already have such step implemented, we just need to fix the defect and
the req. to be able to support filter to show from Node A --> Node B
should be satisfied. </font><br><br><font size=2 face="sans-serif">I also opened issue 426 to support Union
Gremlin step, with such step being added, we will be able to describe a
node and all it's 1st, 2nd etc... connected sub graph (i.e. all relevant
nodes surrounding including the node itself). </font><br><br><font size=2 face="sans-serif">I believe that 417 is also very needed,
so filtering the edges will also be very useful for us.</font><br><br><font size=2 face="sans-serif">:-)</font><br><br><BR>