Simple Tree searching algorithm

Hi folks,
I just need someone to give me a little hint about
the A* (a star) algorithm to be applied on n-nary
tree. I guess some of u reading this may have good
algorithms concept and can help me. I am stuck for 3
nights :(
Thanks a lot in advance for caring to read.No one knows how your tree (API) looks like. So no one knows how your A* algorithm can make a guess as to where to go to find the finish-node. Post what you have been trying here.
When posting code, please use code tags: http://forum.java.sun.com/help.jspa?sec=formatting

Similar Messages

Search Algorithm in Java

Hey Guys,
I have written a crude search algorithm which extracts 4 fields from a database table into the String type of Java. Then this String object is tokenized and then within these tokens I search for the text the user has used.
Once, I faced this problem that one of the String pulled from the DB was so huge that I got the OutOfMemory exception. Simple stating it, the text was so big that my system could not store all that text in one String object.
I resolved this by adding more heap to java by doing:
java -Xmx512M MySearchClass
Now I am afraid that if there is another HUGE text in the DB , I can still run out of memory.
Do I just need to get MORE RAM to my system and allot really huge heap space, such as 4 GB or so , so that if need be, the JVM can use it ?
Suppose I get a server machine with 4 GB RAM, at some stage I'd still have an upper limit on the amount of text I can extract from the DB, right ?
Is there any other way to stream the text from DB and then search ? Remember that I am tokenizing the text in the algorithm, so I think I can't use a buffer, or can I ?
thanks a ton !
-AZ

These are SQL queries. I use SQL queries to pull out the text in the DB and then store it in a String object. The problem is that the text in DB can get so huge that the String object cannot hold it anymore due to memory limits. The JVM gets assigned a heap size and the size of the String object can get really big to exceed the heap size.
I used : java -Xmx512M MySearchClass
That assigned 512MB to the JVM so I haven't encountered the OutOfMemory exception so far. But my guess is that for some other data set, the String can be so big that even 512MB might not be enough.
This search algorithm will be deployed on a server class machine with about 4 GB RAM. So we can give JVM 4GB heap space to use. But its a limitation again , right ?
These text in DB are extracted from PDF files.

Suffix tree clustering algorithm?

I am studying in my final year of computer science and i need to get hold of a suffix tree clustering algorithm that can be used in javascript. I have searched all over the net but have come up with nothing and was wondering if anybody could help!

In the section, "Longest Repeated Substring", it says, "the longest repeated substring of txt[1..n] is indicated by the deepest fork node in the suffix tree, where depth is measured by the number of characters traversed from the root".
However, it doesn't seem to be always true(hmm...probably I interpret it incorrectly).
Consider the original string = abb$
(with index 1234)
the suffix tries looks like
bb$
root--------------
|
| abb$
|----------
the suffix tree looks like
(2,4)
root-------------
|
| (1,4)$
|---------
However, there isn't even a fork node.
But obviously, b is the longest repeated string.
Another example
Consider the original string = abc$
(with index 1234)
the suffix tries looks like
c$
root--------------
|
| bc$
|----------
|
|
| abc$
|----------
the suffix tree looks like
(3,4)
root--------------
|
| (2,4)
|----------
|
|
| (1,4)
|----------
However, there isn't even a fork node either. But in this case, there is no repated string.
Hope anyone can answer this. Thanks.

Help required to customize Simple/Advanced Search. Need to add new fields

Hello,
Module: Oracle Sales Online
EBS version: 12.1.3
Jdev version: 10.1.3.3
Scenario:
- We are dealing with standard oracle pages.
- We have TWO "SIMPLE/ADVANCED SEARCH"s available. Each "Simple/Advanced Search" can be found by navigating through paths "A --> B" and "A --> B --> C --> D" . Here it means one "SIMPLE/ADVANCED SEARCH" page is available at page "B" and another "SIMPLE/ADVANCED SEARCH" is available at page "D".
- In the first search page which is at page "B", both Simple as well as Advanced search has a filter field "Win Probability %", of type VARCHAR2/DROPDOWN with values (10, >=10, <=30, 30, >=30, <=50, 50, >=50, <=70, 70, >=70, <=90, 90, 100)
- In second search page, referring to page "D", the Simple search DOESN'T have the "Win Probability %". And the Advanced Search page has the "Win Probability %" but it is of type - NUMBER/MessageTextInput type.
Issue/Requirement:
- The 2nd Simple/Advanced search pages need to have "WIN PROBABILITY %" field and it should be of VARCHAR2/DROPDOWN with values (10, >=10, <=30, 30, >=30, <=50, 50, >=50, <=70, 70, >=70, <=90, 90, 100) just like the way we had in 1st Simple/Advanced search.
Note:
- Again speaking we are dealing with standard oracle pages
- If you go to the "About this Page", interestingly I found:
i. The "message component layout" for both of them is from the same region , i.e., ASNOpptympSrchRN
ii. Rest of the search filters for both the searchs are from common View Object , i.e., OpptySearchVO1 (for Simple search), OpportunityDetailsVO1 (for advanced search)
iii. The "Stack layout" for both the search pages are same, i.e. XXMASOpptyQryCO
iv. None of the fields are rendered to false (everything is set to be rendered TRUE)
Any response is highly appreciated.
Thanks,
Anand
Edited by: 933590 on Jul 19, 2012 8:18 AM

"XXMASOpptyQryCO is the name of stacklayout or CO?
What is the CO?
Does both pages share same CO?
have you already extended the CO "XXMASOpptyQryCO"?
what is the original CO then? I think in that CO it must be written somewhere, simple search "search allowed = false""
-Here CO what you are referring is a controller.
-FYI pages share same controller.
-And the original controller for both the pages are OpptyUwqCO. Right now its extended controller is XXMASOpptyQryCO
Fact is I didn't create this search page. It was built by some third party members. Also that I do not have the original source nor the documentation pertaining to it. So could you inform as in how should I navigate to the point "Search Allowed = True"
I should have informed that at "B" page, it has a region /oracle/apps/asn/opportunity/webui/ASNMgrOpptyQryRN and at page "D", the region is /oracle/apps/asn/opportunity/webui/ASNOpptyQryRN
Edited by: 933590 on Jul 19, 2012 1:37 PM

OIM 11g r1 custom field in simple user search result

Good morning,
i need to visualize a custom field in the OIM simple user search result table. At the moment, when a simple user search is performed, the returned attribute is only the "Display Name".
For the advanced user search result table, is possible to add other fields modifying the Search Results table configuration in Advanced->User configuration->Search Configuration.
How can i do the same the for simple user search result?
Thank you.

Yes, i tried to add my custom attribute to both Simple and Adv search result table, but without luck. Only Display Name column attribute is shown when a simple search is performed.

ALV Simple Tree: How to customize sum levels?

Hi,
I have the following issue:
I use the ALV Simple Tree to display a hierarchy. In this hierarchy one element is the currency of the values I want to display. Therefore the currency might not be the top-level of the hierarchy and as a consequence the tree/table looks like this:
Region/Curr. | Amount 1 | Currency
EUROPE       | 2000     | ***
- EUR       | 1000     | EUR
- USD       | 1000     | USD
-> Different currencies are added with no respect to currency rates or the likes. Only the currency field is filled with stars.
Question: How can I prevent sums for a tree level?
The hierarchy is flexible, so I require a dynamic solution (for example if there are two levels before the currency or none).
If anyone got a link to the documentation for the Simple Tree (or something like that), I would also really appreciate it!
Kind Regards,
Robert

Hi
I'm using OOP ALV.
data: t_fieldcat TYPE STANDARD TABLE OF lvc_s_fcat,
         wa_fieldcat TYPE lvc_s_fcat.
*populate field cat
wa_fieldcat-col_pos = 2.
wa_fieldcat-tabname = 'ITAB'.
wa_fieldcat-fieldname = 'DB name of teh field Amount1'.
wa_fieldcat-do_sum = 'X'.
wa_fieldcat-coltext = 'Amt'.
APPEND wa_fieldcat TO t_fieldcat.
CALL METHOD o_grid->set_table_for_first_display
    CHANGING
      it_outtab                     = itab
      it_fieldcatalog             = t_fieldcat
      it_sort                        = t_sort
regards,
manju

Creating A Binary search algorithm !!!! URGENT HELP

hi ..
i;m currently tryin to create a binary search algorithm ..
the user should be able to input the size of the array
and also the key that he would like to find.
it also has to have to ability to measure the run time of the algorithm.. it how long it too the algorithm to search through the array and find they key..
i have created 3 classes
the first class is the binary search class
which is the mathamatical side of things
the second class is the Array
this creates an array selection a random first number
and then incrementing from there, so that its a sorted array
the third class is the binary search class
which is my main class.
this class should take the users input
and pass it to the array
and the binary seach accordingly
it should also measure the running time, from when it passes the array
to the binary search class
i am having a really hard time creating this last class.
i have created the other 2 successfully
the codes for the binary search class is as follows
public class BinarySearch
     static int binSearch(int[] array, int val)
         // setting the start and the end of the array
          int low = 0, high = array.length;
          //While loop
          while(low <= high) {
          // How to find the mid point
              int mid = (low + high)/2;
               // if the mid point is the value return the value
              if(array[mid] == val) {
                    return mid;
               // if the value is smaller than the mid point
               // go search the left half
               } else if(array[mid] > val) {
                    high = mid - 1;
               //if the value is greater then the mid point
               // go search the right half
               } else if(array[mid] < val) {
                    low = mid + 1;
          // if value is not found return nothing
          return -1;
}and the code for the Array class is as follows
import java.util.Random;
public class RandomSortedArray
    public int[] createArray(int length)
        // construct array of given length
        int[] ary = new int[length];
        // create random number generator
        Random r = new Random();
        // current element of the array; used in the loop below. Starts at
        // -1 so that the first element of the array CAN be a 0
        int val = -1;
       for( int i = 0; i < length; i++)
            val += 1 + r.nextInt(10);
            ary[i] = val;
        return ary;
}can some pne please help me create my binarysearchTest class.
as i mentioned before
it has to take the users input for the array size
and the users input for the value that they want to find
also needs to measure the running time
thanks for all ur help in advance

import java.util.*;
public class AlgorithmTest
     public static void main(String args[])
         long StartTime, EndTime, ElapsedTime;
         System.out.println ("Testing algorithm");
         // Save the time before the algorithm run
         StartTime = System.nanoTime();
         // Run the algorithm
         SelectionSortTest1();
         // Save the time after the run
         EndTime = System.nanoTime();
         // Calculate the difference
         ElapsedTime = EndTime- StartTime;
         // Print it out
         System.out.println("The algorithm took " + ElapsedTime + "nanoseconds to run.");
    }this is the code i managed to work up for measuring the time..
how would i include it into the main BinarysearchTest Class

Simple Tree using custom container

Hi all,
I am facing a problem, I am preparing a simple tree in a custom container of using two table such as mchb and mska, from these table i am selecting fields wearks ,matrn ,veblen, quantity , lgort (storage location) and made a internal table, for using this fields I sorted three times with werks for plant than storage location for those plant which was sorted than material comes for all sorted plant and storage location ,for all sorting I made node for all i was using CONCATENATE command using index take all values of sorting make local index for all sorting, now i want to make when i double-click on material i want all field come in my tablecontrol which is there and than I want a pop-up window comes for further processing.
plese help me.
Ankur Garg.

Hi Ankur,
Refer the standard program SAPSIMPLE_TREE_CONTROL_DEMO in SE38.
Refer the following code in the include SIMPLE_TREE_CONTROL_DEMOCL1.
CLASS LCL_APPLICATION DEFINITION.
PUBLIC SECTION.
    METHODS:
      HANDLE_NODE_DOUBLE_CLICK
        FOR EVENT NODE_DOUBLE_CLICK
        OF CL_GUI_SIMPLE_TREE
        IMPORTING NODE_KEY,
      HANDLE_EXPAND_NO_CHILDREN
        FOR EVENT EXPAND_NO_CHILDREN
        OF CL_GUI_SIMPLE_TREE
        IMPORTING NODE_KEY.
ENDCLASS.
CLASS LCL_APPLICATION IMPLEMENTATION.
METHOD HANDLE_NODE_DOUBLE_CLICK.
    " this method handles the node double click event of the tree
                                       " control instance
    " show the key of the double clicked node in a dynpro field
    G_EVENT = 'NODE_DOUBLE_CLICK'.
    G_NODE_KEY = NODE_KEY.
ENDMETHOD.
<b>Reward points if it helps.</b>
Message was edited by: Amit Mishra

Simple Federated Search

Does anyone have sample code for running a simple federated search query (e.g., http://search.yahoo.com/search?p=, http://www.m-w.com/cgi-bin/dictionary?book=Dictionary&va=, etc.) ? I would like to add several of these simple searches to the list of federated search engines.
Thanks.

We currently have a field where a user can enter a search term and select the data source from a drop-down list like the following:
<select name="SearchEngines"><option value="http://www.jtbaker.com/asp/catalog.asp?searchdata=">MSDS</option><option value="http://www.m-w.com/cgi-bin/dictionary?book=Dictionary&va=">Dictionary</option><option value="http://www.m-w.com/cgi-bin/thesaurus?book=Thesaurus&va=">Thesaurus</option><option value="http://www.google.com/search?q=">Google</option><option value="http://search.yahoo.com/search?p=">Yahoo!</option><option value="http://www.altavista.com/web/results?q=">Alta Vista</option></select>
What we would like is to have this list of data sources on the "Search Locations" section with check boxes when you click on the Federated Search icon.

Simple Site Search

Anyone figured out how to add a simple site search to your web site using Google, Yahoo, or Bing. The options out there using html coding do not seem to format correctly when added to an inserted object.

Thanks I did look at it but found out that Google will give you an embedded search widget for free that links you in to their search results. Thanks.
Robert C. Whitehead
<mailto:[email protected]> [email protected]
<http://www.hilliardawilbanksfoundation.com/> eMail-Tag-Line3

Click on Simple tree

Hi Experts,
I have a problem ,please help me.
I need event is trigger on single click on node of simple tree.There is event of double click but i need on single click only.
If you have any test program please forward it also.
Ankur Garg.

Hi,
Please check whether the link given below is of any use,
Reaction on "Click" on node of CL_GUI_SIMPLE_TREE
Best Regards.
Reward points if it is useful.

Single Click on simple tree node

Hi Experts,
I have a problem ,please help me.
I need event is trigger on single click on node of simple tree.There is event of double click but i need on single click only.
If you have any test program please forward it also.
Ankur Garg.

i dont think for single click you can get any event in simple list... you can make hotspot on by this way single click will trigger the at line-selection event.
REPORT ZSPDEXDET LINE-SIZE 200 line-count 19(4).
TABLES : MAST,STPO,MARA,MARC.
INCLUDE <SYMBOL>.
DATA : BEGIN OF I_BOM OCCURS 0.
        INCLUDE STRUCTURE STPOX.
DATA : END OF I_BOM.
DATA : BEGIN OF ITAB OCCURS 0,
       STUFE LIKE STPOX-STUFE,
       IDNRK LIKE STPOX-IDNRK,
       WEGXX LIKE STPOX-WEGXX, "NODE NO
       TTIDX LIKE STPOX-TTIDX, "NODE NO WITH PARENTNODE + 1
       VWEGX LIKE STPOX-VWEGX, "NODE NO OF PARENT
       MENGE LIKE STPOX-MENGE,
       SYMBOL,
       END OF ITAB.
DATA : ITAB1 LIKE ITAB OCCURS 0 WITH HEADER LINE,
       ITAB2 LIKE ITAB OCCURS 0 WITH HEADER LINE.
DATA : V_PARENTID LIKE STPOX-VWEGX,
       V_WEGXX LIKE STPOX-WEGXX,
       V_STUFE LIKE STPOX-STUFE,
       PREV_STUFE LIKE STPOX-STUFE.
DATA : V_OFFSET TYPE I VALUE 1,
       V_CONTENT TYPE I,
       TABIX LIKE SY-TABIX,
       V_TABIX LIKE SY-TABIX,
       T_TABIX LIKE SY-TABIX,
       V_SYMBOL,
       V_LINE LIKE SY-TABIX,
       T_INDEX TYPE I.
DATA : V_PAGE LIKE SY-PAGNO,
        T_PAGE LIKE SY-PAGNO,
        V_LIN LIKE SY-LILLI.
PARAMETERS : P_MATNR LIKE MAST-MATNR,
             P_WERKS LIKE MARC-WERKS.
PERFORM BOM_EXPLODE.
ITAB1[] = ITAB[].
READ TABLE ITAB1 INDEX 1.
APPEND ITAB1 TO ITAB2.
PERFORM PRINT TABLES ITAB2.
AT LINE-SELECTION.
V_LIN = SY-LILLI.
T_PAGE = V_PAGE.
PREV_STUFE = ITAB2-STUFE.
V_STUFE = ITAB2-STUFE + 1.
V_WEGXX = ITAB2-WEGXX.
V_SYMBOL = ITAB2-SYMBOL.
IF ITAB2-SYMBOL = '+'.
    ITAB2-SYMBOL = '-'.
    MODIFY ITAB2 INDEX V_TABIX.
ELSEIF ITAB2-SYMBOL = '-'.
    ITAB2-SYMBOL = '+'.
    MODIFY ITAB2 INDEX V_TABIX.
ENDIF.
LOOP AT ITAB WHERE STUFE = V_STUFE AND VWEGX = V_WEGXX.
    V_TABIX = V_TABIX + 1.
    IF V_SYMBOL = '+'.
      MOVE-CORRESPONDING ITAB TO ITAB2.
      ITAB2-SYMBOL = '+'.
      INSERT ITAB2 INDEX V_TABIX.
    ELSEIF V_SYMBOL = '-'.
     IF V_TABIX GT 2.
      LOOP AT ITAB2 FROM V_TABIX WHERE STUFE = PREV_STUFE.
        T_TABIX = SY-TABIX.
        T_TABIX = T_TABIX - 1.
        EXIT.
      ENDLOOP.
       IF V_TABIX LE T_TABIX.
        DELETE ITAB2 FROM V_TABIX TO T_TABIX.
       ELSE.
        LOOP AT ITAB2 FROM V_TABIX.
*          T_TABIX = T_TABIX + 1.
          IF ITAB2-STUFE GT PREV_STUFE.
           DELETE ITAB2 INDEX SY-TABIX.
          ELSE.
            EXIT.
          ENDIF.
        ENDLOOP.
*        DELETE ITAB2 FROM V_TABIX WHERE STUFE LT V_STUFE.
       ENDIF.
       EXIT.
      ELSE.
        DELETE ITAB2 FROM V_TABIX.
        EXIT.
      ENDIF.
    ENDIF.
ENDLOOP.
SY-LSIND = 0.
T_INDEX = 1.
PERFORM PRINT TABLES ITAB2.
SCROLL LIST INDEX T_INDEX TO PAGE T_PAGE . " LINE V_LIN .
*&      Form BOM_EXPLODE
*       text
* --> p1        text
* <-- p2        text
FORM BOM_EXPLODE .
CALL FUNCTION 'CS_BOM_EXPL_MAT_V2'
    EXPORTING
      CAPID                 = 'PP01'
      DATUV                 = SY-DATUM
      MEHRS                 = 'X'
      MTNRV                 = P_MATNR
      WERKS                 = P_WERKS
    TABLES
      STB                   = I_BOM
    EXCEPTIONS
      ALT_NOT_FOUND         = 1
      CALL_INVALID          = 2
      MATERIAL_NOT_FOUND    = 3
      MISSING_AUTHORIZATION = 4
      NO_BOM_FOUND          = 5
      NO_PLANT_DATA         = 6
      NO_SUITABLE_BOM_FOUND = 7
      CONVERSION_ERROR      = 8
      OTHERS                = 9.
IF SY-SUBRC <> 0.
    MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
            WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
ENDIF.
ITAB-IDNRK = P_MATNR.
ITAB-MENGE = '1'.
ITAB-STUFE = '0'.
ITAB-WEGXX = '0'.
ITAB-TTIDX = '0'.
ITAB-VWEGX = '-1'.
ITAB-SYMBOL = '+'.
APPEND ITAB.
CLEAR ITAB.
LOOP AT I_BOM.
    MOVE-CORRESPONDING I_BOM TO ITAB.
    APPEND ITAB.
    CLEAR ITAB.
ENDLOOP.
ENDFORM.                    " BOM_EXPLODE
*&      Form PRINT
*       text
*      -->P_ITAB1 text
FORM PRINT TABLES   P_ITAB1 STRUCTURE ITAB.
DATA : V_ID LIKE STPOX-VWEGX.
DATA : T_LINE LIKE SY-TABIX,
         V_LINE TYPE I,
         V_HLINE TYPE I.
DATA : PAGE TYPE I.
DESCRIBE TABLE P_ITAB1 LINES V_LINE.
T_LINE = V_LINE - 1.
LOOP AT P_ITAB1.
    V_OFFSET = P_ITAB1-STUFE * 3.
    V_CONTENT = P_ITAB1-STUFE * 6.
    V_LINE = P_ITAB1-STUFE * 4.
    IF P_ITAB1-STUFE NE 0.
      V_HLINE = V_LINE + 2.
    ELSE.
      V_HLINE = 2.
    ENDIF.
*    T_INDEX = T_INDEX + 1.
    COMPUTE PAGE = SY-TABIX MOD 13.
    IF PAGE EQ 0.
      NEW-PAGE.
      V_PAGE = SY-PAGNO.
*     T_INDEX = 0.
    ENDIF.
    V_TABIX = SY-TABIX.
    IF P_ITAB1-SYMBOL = '+'.
       WRITE : /.
        WRITE AT : V_OFFSET SYM_PLUS_FOLDER AS SYMBOL
                COLOR 4 INTENSIFIED HOTSPOT.
        WRITE : AT V_CONTENT P_ITAB1-IDNRK,P_ITAB1-MENGE.
      HIDE : P_ITAB1,V_TABIX,V_PAGE.
    ELSEIF P_ITAB1-SYMBOL = '-'.
      WRITE : /.
      WRITE AT V_OFFSET SYM_MINUS_FOLDER AS SYMBOL
                COLOR 4 INTENSIFIED HOTSPOT.
      WRITE : AT V_CONTENT P_ITAB1-IDNRK,P_ITAB1-MENGE.
      HIDE : P_ITAB1,V_TABIX,V_PAGE.
    ENDIF.
ENDLOOP.
ENDFORM.                    " PRINT
regards
shiba dutta

Java library for local search algorithms?

Hi everybody,
Could anyone please help me with the following?
I am looking for a Java library with already implemented local search algorithms. Does such a thing exist? Would anyone recommend one?
I am testing several AI programs and need to select the best parameters for each one (in a relatively large number of experiments). I could write my own search algorithm, of course, but it would be so much easier to use several already implemented algorithms and choose the best one.
Thanks in advance for any pointers.
Anna

Here is an interesting question. Say you build the central control system of a rocket ship using Java, should you then be able to ask questions about rocket ships in Java forums?
Well you can try, but I wouldn't hold your breath to find another rocket scientist in such a place. You may want to go to a forum where rocket scientists congregate in stead. Just a friendly tip.

Regarding ADFbound tree search problem

Hi
I have done adf bound tree search after rendered using the following url
http://www.oracle.com/technetwork/developer-tools/adf/learnmore/61search-in-rendered-trees-177577.pdf
The search is happening as expected, but if i select manually any of the node and try for searching , then search is not happening at all .
Can anybody having idea on this ????????
Regards
Senthil

Dear Frank,
The following is my steps
1. First i did search using some 'X'
2. it selected the node 'X' as expected
3. if i just select a node manually using mouse for example 'Y' for drag and drop into another tree
4. Again i do search with any text , This time search is not happening , and it doesnt happen forever until i log out
manual selection using mouse stops the successive search, can not find the reason , please help me out
Thanks & regards
Senthil

Search Algorithms in Oracle

What are the search algorithms that Oracle supports?

You use SQL to select from a database. You can find the Oracle SQL syntax documentation on tahiti.oracle.com
If you want to get down lower and find how the sql syntax is implemented, then some of this is documented on metalink.oracle.com in notes, and some is in books, and some is unknown ... (you could research your whole life ....)
If you need to ask this question, I think you should start with the basics of blocks, memory, processes, undo, redo etc.

Simple Tree searching algorithm

Similar Messages

Maybe you are looking for