Flip Flop # of Paths and Lists

by Michael McCune

Jun 18, 2009

This is a simple example of re-ordering lists by paths. By using a series of a series you can create an index list that steps by the number of paths that steps by the number of items in each path. Confusing in the picture, but it is easier to understand in the image. This example, of course, works for only paths that have the same number of items!
Load Previous Replies
  • up

    SamuElf

    That was exactly what I was looking for. Problem is that I dont really understand the logic! At least it works!

    Thanks
    6

    Aug 12, 2009

    Load Previous Replies
    • up

      Philipp

      Rather similar question - I have set of N points and second set of M points.
      I need to select several points nearest to each point of thr 1st set from the second set. There are to ways - function + cull pattern and simple sort + select item. Problems begun when i tried to this - becouse there will be M*N resulting data either from distanse (M data for each of rhe N points) and only M points in the list.

      What can I do?
      Is there any way to duplicate brunches (duplicate second set preserving branch ierarchy)???

      Oct 15, 2009

      • up

        Sim Pern Chong

        Thanks All,

        These are helpful.

        Feb 21, 2017