Selection of elements in a recursive tree structure

Hello,
I have a recursive tree structure, and I am dynamically creating the child nodes as the parent nodes get expanded. The structure at runtime after expansion of the nodes would look something like this:
Node 1
---Node 1.1
Leaf 1.1.1
Leaf 1.1.2
Leaf 1.1.3
---Node 1.2
Leaf 1.2.1
Leaf 1.2.2
Node 2
---Node 2.1
Leaf 2.1.1
---Node 2.2
Leaf 2.2.1
Leaf 2.2.2
When I select an item, say Leaf 1.1.1, that item gets highlighted. Now, when I select another node, say Node 2.1, that item gets highlighted as well. The issue now is that both Leaf 1.1.1 and Node 2.1 are highlighted, although I want only the latest selection to be highlighted.
I have the following settings on my context node of the tree:
Initialization Lead Selection = False
Singleton = False
Selection = 0..1
How can I get only the latest selection to be highlighted on the tree?

Hi Venkatramanan,
You are right - the lead selection works perfectly, and it is just an issue with the appearance. But even so, I would like to know if there is some way to control the visual highlighting of the nodes. The main cause of concern is that for a user, if he selects leaf 1 first, and then leaf 2 (from another node) next, both are highlighted, and there is no way to know which one is really selected.
I did look at the component WDR_TEST_EVENTS. The dyn-load recursive tree does not appear to have this problem, but I could not find any special handling in the code.
One more thing: I have the ignoreAction attribute set to true for all the parent nodes. The leaves have this attribute set to false, so they can be selected. But this does not seem to help with the highlighting issue.
Thanks,
Kamal

Similar Messages

Display Tree Structure in a List / Select Box

I need info on the following
1.display tree structure inside a select/combo/list box.
2.Select a node element from the above tree structure.
Thanks in advance

Have you managed to do this?
Faaiez

Multi-selection using windows style tree structure

We developed a solution to replace the standard multi-select functionality with a java based tree structure where upon selection of a node all sub-entries are selected. These entries are then added to the selection.
Performance is however a problem and I would like to know if anyone has experience of implementing such a solution or if there is an alternative standard solution.
regards
Tim

Hello Tim,
Did you try to run an SE30 performance analysis ?
Check out this OSS note:
Note 948066 - Performance Analysis: Transactions to use
And depending on your CRM version, be aware that you can use the ABAP shared memory concept, which will considerably reduce the amount of memory used... hence increasing performance.
Ciao,
Nicolas.

Tree Structure?

Hi Experts,
I need to create a screen like a Tree Structure like below. If I click on the Reporting Group values folder, it should populate data from one table and by clicking on Reporting Group Levels, it should open the subfolder and need to populate the values based on the selection of folder.
Is this Tree Structure can be done in Web Dynpro?If yes, how can I go ahead for my development.
Please clarify me experts.
BR,
RAM.

Hi RAM,
Yes, it can be done in WDA.
Your requirement can be achieved as below
you can create 2 containers side by side in your view i.e. by using PANEL or transparent containers
Tree structure
Create tree uielement
Create context node for tree with required attributes
Populate the data for tree structure with node key
Details Display
Create a table to display data based on tree structure element
if structure of table of each node/leaf element of tree is different, you can create table ui element dynamically based on your data
On click of tree element, based on KEY of the selected element, you can populate the details and fill the table in the right side container
Please refer the demo component for Tree example:
WDR_TEST_TREE
Also, check the below links
Web DynPro ABAP Application using Tree and Frame - Web Dynpro ABAP - SCN Wiki
SAP nxt: How to create a three level tree node in Webdynpro ABAP
Hope this helps you.
Regards,
Rama

Finding elements in a general tree

I am writing a method to find elements in a general tree structure. The structure has a root and each parent node has 0-10 children, whose nodes are stored in an array linked to the parent node. The node class for the tree has a variable info that stores Comparable information. It has a variable numbChildren for the number of children that node has. It also has an array of size 10 containing links to up to 10 child tree nodes. Methods in the node class are getter and setters for child nodes. For example, if a parent node has 5 children, you can access the 3 child of that parent by doing parent.getChild(3-1); There are also getters and setters for the info of the node.
My problem is I have a general tree structure made of the nodes described above, and I need to search that tree to find a given element and return a reference to the node containing the element if it is found. Can someone help give me ideas about how I can search the tree? Just to clarify, a general tree structure is a structure where parent nodes can have any number of children (but in this case there are a max of 10 children allowed.
thanks for any help

For any given node, you check to see if the given node contains the item you're searching for. If not, you check the appropriate child node (since the child nodes are ordered, you should only have to check one). This is called recursion, and your class probably covered it if they gave you this assignment. Start at the root.

Tree Structure in Active Directory

Hi,
I am trying ot come up with a design of some sort if generic LDAP connector different LDAP servers. So far I have been just testing against Active Directory and OpenLDAP.
I know there are numerous implementations out there but the difference in features between these two itself have made the design difficult.
I had a question in regards to the way the data is organized in Active Directory as opposed to OpenLDAP.
In active directory you can have an
OU
CN {person}
CN{group}
Now users under different OU's can have access to other OU's I figure by belonging to the CN{group } under that OU . But the same user can't exists under two different OU's with the exact same attribute values. Is my understanding right??
Now when I used this OpenLDAP Windows version I could very easily create the same user under two different OU's.
Further on in Active Directory you have something called the objectGUID to get to the entry even if it is moved around in the tree casue at one point it can exists in only one place. Is this understanding right??
What happens in case of an OpenLDAP how do we get the unique id?
Please help

tigerkumar wrote:
HI
I am using swing on that JPanel
and
i got the drives of system in my combo box
can u tell me how to show selected drive`s folders in a tree structure
using JTree
how i can show the the directories(folder`s) of a drive into the JTree box
directory to be selected from ComboBox showing driveswhat is wrong with you?
why keep on multi-posting, I give you a solution and you ignore it.
http://forum.java.sun.com/thread.jspa?threadID=5217925&tstart=0
no one will help you if you keep on doing that.

Tree structure of system directory

HI
I am using swing on that JPanel
and
i got the drives of system in my combo box
can u tell me how to show selected drive`s folders in a tree structure
using JTree
how i can show the the directories(folder`s) of a drive into the JTree box
directory to be selected from ComboBox showing drives

tigerkumar wrote:
ok
sorry for that
i will take care of that
Please help me in this problemI have given you an answer in the swing forum and you keep on
multi-posting and ignoring the people who help you.
read the solution here.
http://forum.java.sun.com/thread.jspa?threadID=5217925&tstart=0
I think this is the 4th time you keep on posting the same problem.
next time there would be no help.

How to get the folder name of selected subitem in tree structure?

Hi All,
           I created a tree structure like below.
         ->Folder1-- 1
                          2
                          3
        ->Folder2-----1
                           2
                           3
                i.e i have two folders & each folder having the values like above.Now i want to perform some action by clicking on the any of the values.Suppose if i click value 2,i want to do some action.the actions need to perform is varies from floder to to folder.
        So How can i get the folder name of clicked Value?
Regards,
Ravi

Hi Kumar ,
the below code should help you.
Register the below action for the leaf node for which u need the subfolder's name above it.
Worked fine in my system ...hope it does in ur scenario too
method ONACTIONGET_PATH .
data : lr_element TYPE REF TO if_wd_context_element,
         lr_node TYPE REF TO if_wd_context_node,
         ls_path type string,
         ls_path_node TYPE string,
         lt_string type TABLE OF string,
         l_lines type i,
         l_lines_1 TYPE i.
lr_element = wdevent->get_context_element( 'CONTEXT_ELEMENT' ).
**-> getting the path of the node/leaf
*which u had clicked and from that getting the node above it
ls_path = lr_element->get_path( ).
SPLIT ls_path at '.' into table lt_string.
-> remove the first 2 entries as they will contain the view name
DELETE lt_string FROM 1 to 2.
l_lines = LINES( lt_String ).
l_lines_1 = l_lines - 1.
-> remove the last 2 entries as they will contain the element in the path
DELETE lt_string from l_lines_1 to l_lines.
LOOP AT lt_string into ls_path.
    CONCATENATE LINES OF LT_STRING into ls_path_node SEPARATED BY '.'.
ENDLOOP.
**-> getting access to the node above the leaf element
LR_NODE = WD_CONTEXT->PATH_GET_NODE( path = ls_path_node ).
lr_element = lr_node->get_element( ).
**-> Getting the name of the folder...
*here path is the attribute in my context which stores the name of the folder
lr_element->get_attribute( EXPORTING name = 'PATH' IMPORTING value = ls_path ).
endmethod.

Tree Structure - Is it possible to Open a Pop up/external window on select

Is it possible to Open a Pop up/external window on select of any Leafe node or a parent node?
My requirement is to create a webdynpro screen which depicts the transaction :
ooqa in sap R/3.
Is it possible to do that in tree structure?
Thanks & Regards,
Sirisha.RS

Hi Ayyaparaj,
Thanks for ur reply.
but i cant use a table here. I just need a tree structure..
I guess Its posible by writing a code for a external window open in the onselect method itself.
Thanks & regards,
Sirisha.Rs

Raise event when user select a node or leaf of a recursive tree

What is the event when user choose a node or leaf of a recursive tree? When I select the tree node / leaf it does not raise the event in OnAction. Thanks!

Hi,
TreeNodeType and TreeItemType have ONACTION event assocaited with them. This event gets called when the node or leaf is selected by user. Put a break point in these method, then you'll call to know if they are actually getting called or not.

Select on a tree structure...

Hi Guys,
I have the following tree structure where I want to perform a select to get the below results.
All Nodes are starting from D and types of the nodes are from A, (If a particular node is not connected to a type then it has its parent's type. ex.:- D11 is on A1 type)
..........................D1.(A1)
............................|
......|............|.................|...............|
.....D11......D12..........D13(A3).......D14
...................|.................................|
..............----------...........................D141(A4)
..............|.........|............................|
......D121(A1)...D122.................-------------
........................|......................|............|
..............D1221(A2)............D1411(A4)..D1412
........................|
..................|............|
..........D12211.........D12212
...............................|
.............................D122121
Selection can only be performed in D1, D1221, D13 and D141 nodes.
Perform selection on D1 should return - D11, D121 and D1221 (select lowest level nodes if they are in the same type and if the type of the node is changing then select the first node with the different type)
Perform selection on D1221 will return - D12211 and D122121
Perform selection on D13 will return null
Perform selection on D141 will return - D1411 and D1412
Table structure
seq_no...parent_seq_no...type
..D1................................A1
..D11..........D1........
..D13..........D1................A3
..D1221......D122.............A2
..D12211....D1221.....
..D1411......D141.............A4
Many Thanks and sorry for the long explanation,
Napster

Hi Frank,
Wow it sounds so simple. I was sort of lost with the connected by clause. Now it’s getting clear. Thanks!
One last question... can I used the connected by clause to get the top most node of a set of same type nodes. I used the connected by clause and wrote a function and it returns the exact output I need but it looks little messy. I will try to explain the requirement using the above example tree structure…
In the above example,
If I perform function on,
D1, it should return D1
D11, it should return D1
D121, it should return D1
D122121, it should return D1221
D13 should return D13 itself,
D 141 should return D141 itself,
D 1411 should return D141… etc.
The function I wrote….
FUNCTION Get_Root_Node__ (
   seq_no_ IN NUMBER ) RETURN NUMBER
IS
   CURSOR get_parent_list (seq_no_ NUMBER) IS
      SELECT t.seq_no, t.type_cd
      FROM table_x t
      CONNECT BY PRIOR t.parent_seq_no = t.seq_no
      START WITH t.seq_no= seq_no_;
   CURSOR get_curr_list (seq_no_ NUMBER) IS
      SELECT t.seq_no, t.type_cd
      FROM table_x t
      CONNECT BY PRIOR t.parent_seq_no = t.seq_no
      START WITH t.seq_no= seq_no_;
   top_seq_no_       NUMBER;
   cur_type_cd_      NUMBER;
BEGIN
   FOR parent_rec_ IN get_parent_list(seq_no_) LOOP
        IF (parent_rec_.type_cd IS NOT NULL) THEN
          IF (cur_type_cd_ IS NOT NULL) AND (parent_rec_.type_cd_ <> cur_type_cd_) THEN
             RETURN top_seq_no_;
          ELSE
             cur_type_cd_ := parent_rec_.type_cd_;
          END IF;
       ELSIF (cur_type_cd_ IS NOT NULL) THEN
          FOR curr_rec_ IN get_curr_list(parent_rec_.seq_no) LOOP
             IF (curr_rec_.type_cd IS NOT NULL) THEN
                IF curr_rec_.type_cd = cur_type_cd_ THEN
                   top_seq_no_ := curr_rec_.seq_no;
                ELSE
                   RETURN top_seq_no_;
                END IF;
             END IF;
          END LOOP;
       END IF;
       top_seq_no_ := parent_rec_.seq_no;
   END LOOP;
   RETURN top_seq_no_;
END Get_Root_Node__;Is it possible to get this done by a simple select?

Display recursive tree expanded upto element level

Hi all,
I have created a Recursive tree. I want to show expanded tree upto element level. I saw EXPAND_INTO_ELEMENT mehod of IF_WD_TABLE_METHOD_HNDL and SET_ON_EXPAND_ALL from class cl_wd_tree. Is it useful for me.
Please suggest how it works for me.
Thanks
Sanket

Any suggestions.

Listing File Hierarchy in console using a Tree structure

first off i'm a college student. i'm not that good at java... we got this CA in class and try as i might i just can't get my head around it
i was wondering if someone who know a bit more about java then i do would point me in the right direction, were i'm going wrong in my code
i have to list out sub-files and sub-directorys of a folder (i.e. C:/test) to console using tree structure
like this
startingdir
dir1 //subfolder of startingdir
dir11 //subfolder of dir1
dir111 //subfolder of dir11
dir12 //subfolder of dir1
file1A // document on dir1
dir2 //subfolder of startingdir
Tree.java
import java.util.Iterator;
import java.util.LinkedList;
import java.util.ListIterator;
import java.util.NoSuchElementException;
import java.util.Deque;
public class Tree<E> {
    // Each Tree object is an unordered tree whose
    // elements are arbitrary objects of type E.
    // This tree is represented by a reference to its root node (root), which
    // is null if the tree is empty. Each tree node contains a link to its
    // parent and a LinkedList of child nodes
    private Node root;
    //////////// Constructor ////////////
    public Tree () {
    // Construct a tree, initially empty.
        root = null;
    //////////// Accessors ////////////
    public boolean isEmpty () {
    // Return true is and only if this tree is empty.
         return (root == null);
    public Node root () {
    // Return the root node of this tree, or null if this tree is empty.
        return root;
    public Node parent (Node node) {
    // Return the parent of node in this tree, or null if node is the root node.
        return node.parent;
    public void makeRoot (E elem) {
    // Make this tree consist of just a root node containing element elem.
        root = new Node(elem);
    public Node addChild (Node node, E elem) {
    // Add a new node containing element elem as a child of node in this
    // tree. The new node has no children of its own. Return the node
    // just added.
        Node newChild = new Node(elem);
        newChild.parent = node;
        node.children.addLast(newChild);
        return newChild;
    public E element (Node node) {
         return node.getElement();
    //////////// Iterators ////////////
    public Iterator childrenIterator (Node node) {
        return node.children.iterator();
    public Iterator nodesPreOrder () {
    // Return an iterator that visits all nodes of this tree, with a pre-order
    // traversal.
        return new Tree.PreOrderIterator();
    //////////// Inner classes ////////////
    public class Node {
        // Each Tree.Node object is a node of an
        // unordered tree, and contains a single element.
        // This tree node consists of an element (element),
        // a link to its parent
        // and a LinkedList of its children
        private E element;
        private Node parent;
        private LinkedList<Node> children;
        private Node (E elem) {
            // Construct a tree node, containing element elem, that has no
            // children and no parent.
            this.element = elem;
            this.parent = null;
            children = new LinkedList<Node>();
        public E getElement () {
        // Return the element contained in this node.
            return this.element;
        public String toString () {
        // Convert this tree node and all its children to a string.
            String children = "";
            // write code here to add all children
            return element.toString() + children;
        public void setElement (E elem) {
        // Change the element contained in this node to be elem.
            this.element = elem;
    public class PreOrderIterator implements Iterator {
        private Deque<Node> track; //Java recommends using Deque rather
        // than Stack. This is used to store sequence of nomempty subtrees still
        //to be visited
        private PreOrderIterator () {
            track = new LinkedList();
            if (root != null)
                track.addFirst(root);
        public boolean hasNext () {
            return (! track.isEmpty());
        public E next () {
            Node place = track.removeFirst();
            //stack the children in reverse order
            if (!place.children.isEmpty()) {
                int size = place.children.size(); //number of children
                ListIterator<Node> lIter =
                        place.children.listIterator(size); //start iterator at last child
                while (lIter.hasPrevious()) {
                    Node element = lIter.previous();
                    track.addFirst(element);
            return place.element;
        public void remove () {
            throw new UnsupportedOperationException();
    FileHierarchy.java
import java.io.File;
import java.util.Iterator;
public class FileHierarchy {
    // Each FileHierarchy object describes a hierarchical collection of
    // documents and folders, in which a folder may contain any number of
    // documents and other folders. Within a given folder, all documents and
    // folders have different names.
    // This file hierarchy is represented by a tree, fileTree, whose elements
    // are Descriptor objects.
    private Tree fileTree;
    //////////// Constructor ////////////
    public FileHierarchy (String startingDir, int level) {
        // Construct a file hierarchy with level levels, starting at
        // startingDir
        // Can initially ignore level and construct as many levels as exist
        fileTree = new Tree();
        Descriptor descr = new Descriptor(startingDir, true);
        fileTree.makeRoot(descr);
        int currentLevel = 0;
        int maxLevel = level;
        addSubDirs(fileTree.root(), currentLevel, maxLevel);
    //////////// File hierarchy operations ////////////
    private void addSubDirs(Tree.Node currentNode, int currentLevel,
            int maxLevel) {
    // get name of directory in currentNode
    // then find its subdirectories (can add files later)
    // for each subdirectory:
    //    add it to children of currentNode - call addChild method of Tree
    //    call this method recursively on each child node representing a subdir
    // can initially ignore currentLevel and maxLevel
        Descriptor descr = (Descriptor) currentNode.getElement();
        File f = new File(descr.name);
        File[] list = f.listFiles();
        for (int i = 0; i < list.length; ++i) {
            if (list.isDirectory()) {
File[] listx = null;
fileTree.addChild(currentNode, i);
if (list[i].list().length != 0) {
listx = list[1].listFiles();
addSubDirs(currentNode,i,1);
} else if (list[i].isFile()) {
fileTree.addChild(currentNode, i);
// The following code is sample code to illustrate how File class is
// used to get a list of subdirectories from a starting directory
// list now contains subdirs and files
// contained in dir descr.name
////////// Inner class for document/folder descriptors. //////////
private static class Descriptor {
// Each Descriptor object describes a document or folder.
private String name;
private boolean isFolder;
private Descriptor (String name, boolean isFolder) {
this.name = name;
this.isFolder = isFolder;
FileHierarchyTest.javapublic class FileHierarchyTest {
private static Tree fileTree;
public static void main(String[] args) {
FileHierarchy test = new FileHierarchy ("//test", 1);
System.out.println(test.toString());

Denis,
Do you have [red hair|http://www.dennisthemenace.com/]? ;-)
My advise with the tree structure is pretty short and sweet... make each node remember
1. it's parent
2. it's children
That's how the file system (inode) actually works.
<quote>
The exact reasoning for designating these as "i" nodes is unsure. When asked, Unix pioneer Dennis Ritchie replied:[citation needed]
In truth, I don't know either. It was just a term that we started to use. "Index" is my best guess, because of the
slightly unusual file system structure that stored the access information of files as a flat array on the disk, with all
the hierarchical directory information living aside from this. Thus the i-number is an index in this array, the
i-node is the selected element of the array. (The "i-" notation was used in the 1st edition manual; its hyphen
became gradually dropped).</quote>

Org Chart in tree structure

Hi Friends,
How to Create a tree structure for org. unit in web dynpro ABAP
and call the tree in F4 Help of a input box.

Good advice there guys.
I myself just finished such an implementation at one of my customers. It took 2 days to complete. I can't give you the solution as the customer retains the immaterial rights for the solution but I thought I would tell you the steps involved to get you on the right track.
1. Context. Build a context node that on the top level has the orgunit, it's attributes (such as otype, objid, stext, etc) and the recursive node that points to the orgunit node. Inside the orgunit create a node for the position. Inside the node place the attributes for the position (like before) and a recursive node that points to the position node. Finally inside the position node place a node for the person and it's attributes (like before), but no recursion node this time.
2. Layout: Place a tree element in your view. Inside the tree element insert two node types and one item type. First node is for orgunit, second one is for position. The only item is for the person. You might want to add respective icons, to get nicer UI. Add the load children action for orgunit and position. Depending on what you want to select from the tree, add a select action for either orgunit, position or person.
3. Code #1: as Chris points out, use RH_STRUC_GET to get the organization tree. I myself used O_S_P. You might want to create a FM that returns all 3 itabs returned by RH_STRUC_GET to the WDA. Create a freely programmed value help as suggested in many threads, it's pretty straight forward. In the WDA utilizing the VH, mark one or more items in the context as freely programmed VH and connect to your implementation.
4. Code #2: At start up, for example in the WDDOINIT method, create only the root node and call it for example "All organization units". Then create one action that is called when children nodes have to be loaded, one method for figuring out what do when a child is being requested (and what kind of child: orgunit, position or person) and finally a method for actually creating the node.
5. Code #3: The magic comes from RH_STRUC_GET. Use the STRUC itab at runtime to find the objects at certain levels and to determine their parent(s) and children. The most important values in the STRUC itab in this case are LEVEL, OTYPE, OBJID and PUP.
Pretty straight forward and the solution is quite nice indeed. I'm sorry if I forgot something, I wrote this without access to the system.

Select the multiple nodes in a tree

Hi Experts,
We need to select the multiple nodes in a tree.Whatever we are selecting,that has to be added in the table as a tree structure itself.
For ex:
A
|--A1
|--B1
If We select the A then A,A1 and B1 has to be added in a table.Please help me out for this.
Regards
Nutan
Edited by: Armin Reichert on Jan 29, 2008 2:33 PM

Hi,
You have to create a recursive node and use the tree by nesting UI component
Following tutorial will be of use
https://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/com.sap.km.cm.docs/library/user-interface-technology/webdynpro/wd%20java/wdjava%20tutorials%20and%20articles%20archive/constructing%20a%20recursive%20and%20loadable%20web%20dynpro%20tree.pdf
Recursive Node
http://help.sap.com/saphelp_nw70/helpdata/en/5d/97384162316532e10000000a1550b0/frameset.htm
TreeByNesting
http://help.sap.com/saphelp_nw70/helpdata/en/92/12a74046033913e10000000a155106/content.htm
https://www.sdn.sap.com/irj/sdn/go/portal/prtroot/docs/webcontent/uuid/28113de9-0601-0010-71a3-c87806865f26?rid=/library/uuid/49f2ea90-0201-0010-ce8e-de18b94aee2d#31 [original link is broken]
Regards
Ayyapparaj

Selection of elements in a recursive tree structure

Similar Messages

Maybe you are looking for