recursive-datastructures

I have a complex Python data structure (if it matters, it's a large music21 Score object) which will not pickle due to the presence of a weakref somewhere deep inside the object structure. I've debugged such problems with the stack trace and python debugger before, but it's always a big pain. Is there a tool which runs dir() recursively on all attributes of an object, finding objects hidden in lists, tuples, dicts, etc., and returns those that match a certain value (a lambda function or something like that). A big problem is recursive references, so some sort of memo function (like copy

I have an array of file-path strings like this videos/funny/jelloman.wmv videos/funny/bellydance.flv videos/abc.mp4 videos/june.mp4 videos/cleaver.mp4 audio/uptown.mp3 audio/juicy.mp3 fun.wmv jimmy.wmv herman.wmv End goal is to get them to jsTree. I built a prototype tree from the above sample strings. check it out: http://jsfiddle.net/ecropolis/pAqas/ Firstly I would create a recursive function to iterate through your directory into an array function ReadFolderDirectory($dir,$listDir= array()) { $listDir = array(); if($handler = opendir($dir)) { while (($sub = readdir($handler)) !== FALSE) {

I have several classes that contain a recursive dependency on each other and I serialize them to JSON format with Gson GraphAdapterBuilder, and it works perfectly. Now I want to deserialize them into the same structure but can't find out how. I've made an example: class ClassA{ public int field; public ClassB parent; public ClassA(int f, ClassB p){ field = f; parent = p; } } class ClassB{ public Vector<ClassA> vector = new Vector<ClassA>(); } ... ClassB b = new ClassB(); ClassA a1 = new ClassA(1,b); ClassA a2 = new ClassA(2,b); ClassA a3 = new ClassA(3,b); b.vector.add(a1); b.vector.add(a2); b

I am having trouble in thinking/solving the problem in terms of recursion. I really appreciate the concept and I can understand them like creating base case, exit case & the recursive calls etc. I can solve simple problems like writing factorial or summation of integers in an array. That's where my thinking stops. I couldn’t really apply the concepts or come up with solutions when problem gets complicated. For instance, tower of Hanoi, though I can understand the problem and solution, I, on my own can't up with a solution. It applies to other algorithms like quick sort/binary tree traversal as

If in ML, an example of a recursive datatype is: datatype llist = Nil | Node of int * llist What is a mutually recursive datatype and whats an example of it, in ML? One such example could be these stupid datatypes. datatype a = A | Ab of b and b = B | Ba of a They make no sense, but they show that it is possible to use the and keyword (just as with functions) to reference something "ahead" which is normally not possible They are mutually (as they both...) recursive (...reference each other) The standard basic example of mutually recursive data types is a tree and a forest: a forest is a list

I have following JSON. [{ "ID": "Root_1", "Name": "Root_1", "ParentID": "", "Sequent": 1 }, { "ID": "Root_2", "Name": "Root_2", "ParentID": "", "Sequent": 2 }, { "ID": "Root_1_Sub_1_Child_1", "Name": "Root_1_Sub_1_Child_1", "ParentID": "Root_1_Sub_1", "Sequent": 1 }, { "ID": "Root_1_Sub_1_Child_2", "Name": "Root_1_Sub_1_Child_2", "ParentID": "Root_1_Sub_1", "Sequent": 2 }, { "ID": "Root_1_Sub_1", "Name": "Root_1_Sub_1", "ParentID": "Root_1", "Sequent": 1 }] I want to change my JSON to as following. [{ "ID": "Root_1", "Name": "Root_1", "ParentID": "", "Sequent": 1, "Sub": [{ "ID": "Root_1_Sub_1