Hi guys, I've finally succeeded!
The trick was to play with the DependencyGraphTransformers in order to get a non-reducted dependency tree. Then I used Aether's PostorderNodeListGenerator to sort the nodes, and finally I removed the duplicated nodes. Thanks a lot, Jérémy On Wed, Nov 9, 2011 at 2:32 PM, Jérémy <[email protected]> wrote: > Thank you guys! > > I'll give a try to the Aether implementation :-) > > Regards, > Jérémy > > > On Tue, Nov 8, 2011 at 9:41 PM, Ansgar Konermann < > [email protected]> wrote: > >> Am 08.11.2011 21:36, schrieb Ansgar Konermann: >> > >> > Example code can be found >> > [...] >> Some more example code here: >> >> https://docs.sonatype.org/display/AETHER/Home >> >> >> Ansgar >> >> --------------------------------------------------------------------- >> To unsubscribe, e-mail: [email protected] >> For additional commands, e-mail: [email protected] >> >> >
