I would like to pick a random node, call getNodeInfo and see it's latest milestone.
Then I'd like to walk the graph (depth first search? breadth first search?) backwards to the start and map the entire graph.
I.e. this is the "sync" operation a wallet would do when it first starts up and has zero stored transactions.
I've looked at the IRI java code but I'm missing the simple logic to take the milestone value from a node, and call GetTrytes to turn that into a full 2673 length tx, then take the Bundle, and/or TrunkTransaction, BranchTransaction, Address and get the next hop, and the next hop, etc.
When I try to write this logic myself I get a few hops, but then I quickly reached the end of some path and don't walk the entire tangle.
Does anyone have simple Pseudocode to walk the entire tangle?