Thread: Recurssion programming to retrieve inner values of objects

Hi,
I am stuck with one of the programmatic logic implementation.Can any one please help me in this regards.The issue is described below.

I have classes called Event and Method.The structure looks like below.

Class Event {
private long eventId;
private String eventName;
private Map<String,Method> methods;
//setters and getters
}

class Method {
private long methodId;
private String methodName;
private Event triggeredEvent;
// setters and getters.
}

I have a top level Event and it contains a map of Methods (objects of Method class) and again each method can contain one triggered event which again a class of Event.The triggered event can contain again methods.

My issue is to traverse from top level Event to down level event and find out the event count and delivery method count at each level

Attached is tree structure of the issue with a sample example and result expected.

I have been struggling to implement this logic.Can any one please help me out.Capture.JPG

Seems like a pretty complicated data structure... What problem are you facing? Maybe it's possible to simplify data structure?
Also, Method class is a part of java core classes, so it's a bad practice to define your own class with same name.

Anyway, here's a brief sketch of how might you do what you want to, with breadth first search.
1. Initialize data structures where you want to store yielded information (for example, the counter data of each level of the tree may be grouped into list)
2. Define a method that would accept a collection of events as an argument. Inside the method:
2.1. Count all the events
2.2. Count all the methods of the events
2.3. Store the data at (1) data structure
2.4. Create and fill the collection of events of lower level (from the collection of events passed to this method as an argument)
2.5. Call this method on the (2.4.) collection recursively
3. Don't forget to specify termination condition!