Prim's Algorithm...Help me!

Graph Theory Project:
1. Implement Prim's algorithm in Java using the data structures and the
pseudo-code from handout. Your output should produce a set of vertices and
edges of a spanning tree of the example.
Prim's Algorithm
Problem: Determine a minimum spanning tree.
Inputs: integer n>=2, and a connected, weighted, undirected graph containing
n vertices. The graph is represented by a two-dimensional array W, which has
both its row and columns indexed from 1 to n, where W[ i ] [ j ] is the
weight on the edge between the ith and the jth vertex.
Output: set of edges F in a minimum spanning tree for the graph.
public static set_of_edges prim( int n, number [ ] [ ] W)
index i, vnear;
number min;
edge e;
set_of_edges F;
index [ ] nearest = new index [2 . . n];
number [ ] distance = new number [2 . . n];
F = null or empty value;
for ( i = 2; i <= n; i++) {
nearest [ i ] = 1; // For all vertices, initialize v1 to be the nearest
distance [ i ] = W[1] [ i ]; // vertex in Y and initialize the distance
//from Y to be
} //the weight on the edge to v1.
repeat (n - 1 times) {                           //Add all n-1 vertices to Y.
min = (infinity)
for (i = 2; i <= n; i++); //Check each vertex for
if (0 <= distance [ i ] < min) {              //being nearest to Y.
min = distance [ i ];
vnear = i;
e = edge connecting vertices indexed
by vnear and nearest [vnear];
add e to F;
distance[vnear] = -1; //Add vertex indexed by vnear
for ( i = 2; i <= n; i++) // to Y.
if (W[ i ] [vnear] < distance[ i ]) //For each vertex not in Y,
distance [ i ] = W[ i ] [vnear]; //update its distance from Y.
nearest[ i ] = vnear;
return F;
}

My level in intermediate in Java. Yes. I have been
told how to do output to produce a set of vertices
and edges of a spanning tree. I am not going to do
make applet graph only to show numbers.Ok, you're intermediate in Java, so you know the syntax and should be able to make a start.
When you run into problems with your code, post it here on the forum (using code tags: http://forum.java.sun.com/help.jspa?sec=formatting) and explain what it is you're having trouble with.
Good luck.

Similar Messages

  • Need algorithm help

    I need some help with my 3 class hangman program.
    whenever the program is run, it doesn't function as intended when a letter is entered. Any advice is greatly appreciated.
    Here's what I have so far:
    import java.awt.*;
    import java.awt.event.*;
    import javax.swing.*;
    //<applet code="Hangman.class" width=400 height=400>
    //</applet>
    public class Hangman extends JApplet implements ActionListener
         private final int WIDTH = 400;
         private final int HEIGHT = 400;
         private JPanel panel,tools;
         private JLabel inputLabel;
         private Hang drawing;
         private JTextField guess;
         RandomWord t = new RandomWord();
         public String answer = t.getWord();
         public void init()
              tools = new JPanel();
              tools.setLayout(new BoxLayout(tools,BoxLayout.X_AXIS));
              tools.setBackground(Color.yellow);
              tools.setOpaque(true);
              guess = new JTextField(1);
              guess.addActionListener(this);
              inputLabel = new JLabel("Enter Guess:");
              tools.add(inputLabel);
              tools.add(guess);
              drawing = new Hang();
              panel = new JPanel();
              panel.add(tools);
              panel.add(drawing);
              getContentPane().add(panel);
              setSize(WIDTH,HEIGHT);
         public void actionPerformed(ActionEvent event)
              String g = guess.getText();
              int incorr = 0;
              int c = 0;
              int i;
              for(i = 0;i<answer.length();i++)
                   if((answer.substring(i,i+1)).equals(g))
                        c++;
                        drawing.setLetter(i,g);
              if(c == 0)
                   incorr++;
                   drawing.setIndex(incorr);
              repaint();
    // class number 2:
    import java.awt.*;
    import javax.swing.JPanel;
    public class Hang extends JPanel
         private final int PAN_HEI = 400;
         private final int PAN_WID = 400;
         private int index;
         private int posNum,corr = 0;
         private String print;
         public Hang()
              setBackground(Color.black);
              setPreferredSize(new Dimension(PAN_WID,PAN_HEI));
         public void setIndex(int v)
              index = v;
         public void setLetter(int y,String s)
              print = s;
              posNum = y + 1;
         public void drawBase(Graphics page)
              setBackground(Color.white);
              page.setColor(Color.black);
              page.fillRect(0,350,150,50);// base
              page.fillRect(0,150,25,200);
              page.fillRect(0,125,100,25);
              page.setColor(Color.gray);
              page.fillRect(84,125,7,50);// rope
              page.setColor(Color.black);
              page.drawOval(75,175,24,25);// head
              page.drawLine(250,55,255,55);
              page.drawLine(260,55,265,55);
              page.drawLine(270,55,275,55);
              page.drawLine(280,55,285,55);     
              page.drawLine(290,55,295,55);
              page.drawLine(300,55,305,55);
              page.drawLine(310,55,315,55);
         public void paintComponent(Graphics page)
              super.paintComponent(page);
              this.drawBase(page);
              if(index == 1)
                   page.drawLine(84,200,84,250);
              if(index == 2)
                   page.drawLine(84,215,34,175);
              if(index == 3)
                   page.drawLine(84,215,116,175);
              if(index == 4)
                   page.drawLine(84,250,50,300);
              if(index == 5)
                   page.drawLine(84,250,100,300);
                   page.drawString("You Lose",250,75);
              if(posNum == 1)
                   corr++;
                   page.drawString(print,250,50);
              if(posNum == 2)
                   corr++;
                   page.drawString(print,260,50);
              if(posNum == 3)
                   corr++;
                   page.drawString(print,270,50);
              if(posNum == 4)
                   corr++;
                   page.drawString(print,280,50);
              if(posNum == 5)
                   corr++;
                   page.drawString(print,290,50);
              if(posNum == 6)
                   corr++;
                   page.drawString(print,300,50);
              if(posNum == 7)
                   corr++;
                   page.drawString(print,310,50);
              if(corr == 7)
                   page.drawString("You Win",250,75);
    //last class :
    import java.util.Random;
    public class RandomWord
         Random g = new Random();
         String w1;
         String w2;
         String w3;
         String w4;
         String w5;
         String w6;
         String w7;
         String w8;
         public RandomWord()
              w1 = "freedom";
              w2 = "justice";
              w3 = "impulse";
              w4 = "destiny";
              w5 = "celsius";
              w6 = "ignited";
              w7 = "believe";
              w8 = "realize";
         public String getWord()
              String x = " ";
              int a = g.nextInt(6);
              if(a == 0) x = w1;
              if(a == 1) x =  w2;
              if(a == 2) x =  w3;
              if(a == 3) x = w4;
              if(a == 4) x = w5;
              if(a == 5) x = w6;
              if(a == 6) x = w7;
              if(a == 7) x = w8;
              return x;
    }I'm a very inexperiencd programmer as you can see.

    Darn, I thought you actually needed algorithm help. But instead all I see is:
    "Here's all my code. It doesn't work right. Let me plop it onto your virtual desk and ask that you just fix it for me. I'm going shopping (or whatever) and will be back soon."

  • Color Picker scripting or Levels algorithm help

    First question is: Does anyone know of a good explanation of the Levels algorithm as in how each setting affects a pixel in an image. If I change the midpoint of the levels, how would a specific pixel change in relation to that? I've been experimenting for hours and can't figure a common factor other than it seems to be a binary type relationship. The reason I ask this is because I'm trying to script something that will balance colors.
    If that method isn't practical, I can go to the old fashioned trial and error method but this way also presents a roadblock to me. I set a color picker point and the script can obtain the values from that point exactly as it is in the Info panel. If I put a levels adjustment layer over top and adjust it, I now see the original color value and the adjusted color value in the Info panel, but I can't figure out how to obtain the adjusted value with a script. It still returns the original value. Does anyone know a way to obtain the adjusted value?
    I hope I explained this right.

    Thanks, Michael.
    I'll have to look through that post on ps-scripts.com in more detail. That might be what I need.
    This little snippet you wrote:
    Michael L Hale wrote:
    This thread may help with the levels part. http://ps-scripts.com/bb/viewtopic.php?t=2498
    As for the adjustment layer you need to get the color twice. Once with the adjustment layer visible then again with it not visible.
    var csColor = activeDocument.colorSamplers[0].color;
    activeDocument.layers.getByName('Levels').visible = false;
    var csColor2 = activeDocument.colorSamplers[0].color;
    alert( csColor2.rgb.red + " : " + csColor.rgb.red );
    doesn't get me the before and after values. Example: The point I selected has a red value of 226. I added a Levels adj layer on top and moved the midpoint so the red value at that point (adjusted) was 234. I ran your code and it came back with 225.591439688716 : 225.591439688716. It isn't showing the adjusted value of that point.

  • BGP decision algorithm - help needed - stumped

    Hello gurus!  hoping for a BGP expert to chime in here. Im studying for my CCIE, and there is something in Jeff Doyle's Routing TCP/IP vol2 book that I just cant seem to figure out and its really stalling my understanding of the BGP path selection algorithm.  
    Its on pg 195, example 3-57, attached as an image in this post (Ive also attached the network diagram that this output refers to). Basically its an output of "show ip bgp" and whats stumping me is simply: for the aggregate route 192.168.192.0/21, why has this router selected as best (>) the one via next hop 192.168.1.254?? I would have thought based on the presence of the LocalPref = 100 on the 192.168.1.237 route that would have been selected.  But apparently not! Heres a walk through of the path selection logic as i understand it:
    1/WEIGHT: both 0, so skipped. 
    2/LOCAL_PREF: this is my problem, .237 should win, but ignoring for now...
    3/ORIGINATED LOCALLY: neither are they are learnt from BGP peers, so skipping.
    4/AS_PATH: both identical, AS100 only, so skipping
    5/ORIGIN CODE: both are 'i' (IGP), both were created from "aggregate-address" statements on their originating routers downstream in AS100
    6/MED: both empty, so skipping
    7/PREFER [eBGP] over [confedBGP] over iBGP: so the .254 route apparently wins on this condition... which in isolation, i agree with (clearly the eBGP .254 route is better than the .237 iBGP candidate).
    .... however what about step 2/LOCAL_PREF!?  
    looking forward to some expert guidance here to help me squash this one :) 
    thank in advance, 
    Keiran

    Hello,
    Keiran are you talking about "Orgin" attribute or ORIGINATED LOCALLY as this attribute i am not able to find it...that attribute anywhere:
    http://netcerts.net/bgp-path-attributes-and-the-decision-process/
    Path Attributes:
    Attribute
    Class
    ORIGIN
    Well-know mandatory
    AS_PATH
    Well-know mandatory
    NEXT_HOP
    Well-know mandatory
    LOCAL_PREF
    Well-know discretionary
    ATOMIC_AGGREGATE
    Well-know discretionary
    AGGREGATOR
    Optional transitive
    COMMUNITY
    Optional transitive
    MULTI_EXIT_DISC (MED)
    Optional nontransitive
    ORGINATOR_ID
    Optional nontransitive
    ORGINATOR_ID
    Optional nontransitive
    CLUSTER_LIST
    Optional nontransitive
    Also there is similar question on learning forums:
    https://learningnetwork.cisco.com/thread/36845
    From the forum:
    "Locally Originated means that the local router is the one that generated the route with either a network statement, and aggregate statement, redistribution, or conditional route injection.  It's not an attribute that is included in the UPDATE messge, instead it's just used by the local process as part of the path selection, where the router will prefer its own locally originated routes over someone else's origination of the same prefix."
    Hopefully this will help.
    BTW i am reading same book and too bad Mr. Doyle did not include full configs for all routers, as i am trying to simulate his scenarios sometimes it is not working as in his book, now i have issue on next page 197 why Orgin IGP is not taking precedence over Incomplete even if one is learned via EBGP and other over iBGP...driving me nuts.
    Regards,
    Lukasz

  • Combination Algorithm Help

    I have a basic outline of an algorithm that produces combinations of 1-8 but I would like to produce the combination 8C3. What changes need to occur with this problem to get the answer that I'm looking for. Your help will be greatly appreciated. Thanks a lot.
    import java.io.*;
    import java.util.*;
    import java.util.Vector;
    public class Combs
         public static void main(String[] args)
              System.out.println(get("1 2 3 4 5 6 7 8"));
         public static String get(String s)
              StringTokenizer st = new StringTokenizer(s);
              Vector v = new Vector();
              while(st.hasMoreTokens())v.add(st.nextToken());
              String a = "";
              for(int i=v.size()-1; i>=0; i--)
                   for(int j=0; j<v.size(); j++)
                        if(j != i)
                             a += (String)v.get(j);
                   a += "\n";
              return a;
    PS if anything is unclear please ask and I will try to clear up my questions. Thanks again

    I have posted a related code in the following.
    http://forum.java.sun.com/thread.jsp?forum=31&thread=382917&start=0&range=15#1647420

  • Algorithm Help: Adjustable scale marks

    I'm writing an app which displays a scale which is movable and resizable. It might display a range from 0.127 to 0.516, or 10,657 to 100,453.
    1 - I know from the size of the font and window, number number of marks which I want drawn across that range. A value nominally between 10 and 15.
    2 - I want the marks to be on sensible boundaries, 0.1, 0.25, 0.5 etc.
    An example is that for a range 0.089 to 1.272 I'd want ticks 0.1, 0.2 ... 1.1, 1.2
    Can anyone offer me any help with an algorithm to work out the ticks.
    Thanks.
    Dave.

    I have always had to brute force this kind of thing. But I would try the following. Subtract the smaller number from the larger number and divide by the number of ticks. (or the number of ticks + 1, whichever works!) This gives you units per tick. Adjust the lower tick to be the nearest sensible number below your minimum.
    This is tricky and there will be lots of special cases. If your ranges are in any way consistent, it might be best to use a bunch of canned ranges.

  • I need an algorithm, HELP!

    If I input something like this:
    a->b,
    a->c,
    b->d,
    d->a,
    and so on, could be many,
    the the output is this: a->b->d->a, which is a circle from the input.
    I need such a algorithm to help me find out all the circles from the input.

    Cross post of [http://forums.sun.com/thread.jspa?threadID=5447698&tstart=0|http://forums.sun.com/thread.jspa?threadID=5447698&tstart=0].
    Please don't post the same question in multiple forums since people may waste their time answering in one forum when a perfectly good response has been posted in another forum. If you feel the need to get a wider exposure of your problem then create a thread that links to the master thread and request responses be made only in the master thread.
    I shall lock this thread.

  • Genetic Algorithm help please!!!!

    Hi people, i really need help badly with a project im doing as im not very good at programming yet,
    The project is as follows
    Project Allocation
    This project will develop a Genetic Algorithm that will evolve project allocations, with the aim of maximising several criteria: giving every student the highest ranked project possible, spreading the project load between lecturers etc. It should work for a single group of students, and for several groups. This project could be coded in any suitable language.
    Any help in coding this would be really welcomed!
    Thanks

    kennalan wrote:
    your right warneja but what can i do, Start by learning English: that should be "you're", as in "you are".
    What can you do? Do what all students are expected to do - work hard, struggle with difficult material until you achieve some measure of mastery, and accept the result.
    i just need some source code Our source code? Something that you'll steal and pass off as your own? In my universe, that's called "cheating". What do you call it?
    or anything to help!Here's some advice: Don't come back here unless you have problems with code that you've written, with specific questions about the problems.
    Google for something and get started. I recommend "Java genetic algorithms" as a search criterion.
    %

  • Cisco Prime Assurance install Help..!!!! :( :(

    Hi all,
    We would like to bring cisco prime assurance 9.1 in to our Organization
    Guys could you please provide me install guide or screen shot of the  application for the assurance version 9.1 and I wanted to know the prerequisite  for this application like server requirement etc
    We are having a UCS in which we can run a VM machine but I wanted to know is  cisco prime is installed on windows server 2008 ent edition R2,R1?
    Or it has any OVI template like CUCM or how do I install and integrate  it?
    Please help me to proceed in this case..
    Rgds,
    Rebecca
    God bless u all!!

    Hi Rebecca,
    Well....at least you're getting there
    I believe you'd need glabaladmin for the UI as admin is for cli;
    User Accounts
    For  Prime Collaboration, you will be required to specify various passwords  at different instances. This section is designed to help you specify  appropriate passwords in several scenarios that demand your login  credentials (applicable for both converged application and standalone  Prime Collaboration Assurance and Prime Collaboration Provisioning  applications).
    •globaladmin- A superuser who can access both Prime Collaboration Assurance and Prime Collaboration Provisioning UIs.
    •globaladmin  password- Specify this password when you configure your virtual  appliance for either standalone or converged applications. See Configuring the Prime Collaboration Assurance Virtual Appliance and Configuring the Prime Collaboration Provisioning Virtual Appliance. You are also required to specify this password when you log in to the UI (see Password Rules for root User and globaladmin).
    In  Prime Collaboration Provisioning, this password is synched with the  password of postgres admin (to perform backup and restore operations).  The password is then updated in the database and in the /opt/cupm/sep/dfc.properties file. You must log in as a root user to access the dfc.properties file.
    Note If  you plan to install both Prime Collaboration Assurance and Prime  Collaboration Provisioning, ensure that you specify the same password  for both applications during installation.
    •CLI Admin Username—The default username is admin. However, you can specify the username of your choice.
    •CLI  Admin Password—Specify a password for the SSH CLI admin. This password  is used to log in to the CLI to check the application status and perform  backup and restore (see Password Rules for CLI admin).
    The  CLI is supported only through SSH; Telnet is not supported. You can log  in through SSH using port 26 for Assurance and port 22 for Provisioning.
    •Root user—A superuser who has all privileges in Linux shell.
    •Root password—Specify a password for the root user (see Password Rules for root User and globaladmin).
    Password Rules for root User and globaladmin
    •Must contain at least one of each: lowercase letter, uppercase letter, number, and special characters.
    •No character in the password may be repeated more than three times consecutively.
    •Cannot contain non-ASCII characters, %, +, and &.
    •Cannot be cisco or ocsic or any variant obtained by changing the capitalization of letters therein, or by substituting 1,!, or | for i, substituting 0 for o, or substituting $ for s.
    •Cannot be same as the username, and cannot be the username reversed.
    •Must contain from 8 to 80 characters.
    •Cannot end with these characters: *, ; or #.
    Caution We recommend that you write down the root password, as it cannot be retrieved.
    Note•To  change the root password, you must log in as root user and execute the  "passwd" command, which prompts you for a new password.
    •If  you are planning to integrate Provisioning and Assurance servers, make  sure that you adhere to the Assurance-specific globaladmin password  rules while setting up / creating the password for globaladmin in  Provisioning.
    Password Rules for CLI admin
    •Must contain atleast six characters.
    •Must contain at least one of each: lowercase letter, uppercase letter, and number.
    •Must not be the same as the username itself.
    Installation Prompts
    We  recommend that you find out the values beforehand for the following  parameters, as you will be required to enter them at the console prompts  when you configure the virtual appliance:
    •IP address—The IP address of the virtual appliance. If you wish to change the IP address, see
    •IP default netmask—The default subnet mask for the IP address
    •IP default gateway—The IP address of the default gateway
    •Default DNS domain—The default domain name
    •Primary nameserver—The primary name server. You may add a name server. To configure several name servers, enter y.
    •Primary NTP server[time.nist.gov]—The primary NTP server. To enter a secondary NTP server, enter y at the next prompt.
    Note Prime Collaboration 9.5 supports three NTP servers. To configure a tertiary NTP server, enter y at the next prompt, after you specify a secondary NTP server.
    •Timezone—The  timestamp that is displayed on the UI is the server time. By default,  the configured timezone is UTC. For a list of supported timezones, see Supported Timezones for Prime Collaboration. You must use the same timezone for Prime Collaboration Assurance and Prime Collaboration Provisioning servers in converged mode.
    •Username—The CLI admin username. The default is admin. However, you can specify the username of your choice.
    •Password—The  CLI admin password. This password is used to log in to the CLI to check  the application status and perform backup and restore.
    •Root user—A superuser who has all privileges in Linux shell.
    •Root password—Specify a password for the root user.
    •globaladmin—A  superuser of the application who has all privileges, and whose account  used for initial login to the application (UI).
    •globaladmin password—Specify a password for the globaladmin.
    •Network deployment mode-Select the network deployment mode you need. Specify E for Enterprise Deployment or M for Managed Service Provider Deployment (E/M).
    http://www.cisco.com/en/US/docs/net_mgmt/prime/collaboration/9.5/quick/start/guide/Cisco_Prime_Collaboration_Quick_Start_Guide_9_5.html#wp109430
    Cheers!
    Rob
    "When it comes to luck you make your own  " 
    - Springsteen

  • Logic Execution Algorithm - Help

    Help for me - Logic Execution Algorithm
    Considering the Execution Sequence 1: Consider the following information in the table GBI_PAR_DEFINE_ROTA parameterized.
    The required fields are filled in by users: Required_Res_1 and one of the fields:
    Product_id, customer_id or Sales_Order_No.
    Off the field will only be filled with the value N if you want to disable the rule. If the value of the rule is N, the routine being developed disregard the rule.
    REQUIRED_RES_1 PRODUCT_ID SALES_ORDER_NO CUSTOMER_ID OFF
    P_P_LAM2 P_289874 18669437-20 WHGA
    Step 1: Find Table MP_WO_REP which records have sales order number 18669437-20.
    Step 2: Within these sales orders, search through the table Works_Operation which ones have the field Product_ID = P_289874.
    Step 3: Restrict further data selection Sales_Order searching the table, which of them belong to the client WHGA.
    Step 4: In the records remaining in the table Works_Operation verify which code Alternate_Pref whose field Required_Res_1 equals P_P_LAM2. If more than one return Alternate_Pref (different) for the same product_id Required_Res_1 and generate a table of error called GBI_ERR_ALTERNATE_PREF, containing the following information: Required_Res_1, Works_Order and product_id. If this error occurs, the following steps should not be performed.
    Step 5: In the remaining records, delete those records whose field Alternate_Pref is different from the value returned in Step 4. IMPORTANT NOTE: The records can only be deleted if they exist for the same product_id Alternates_Prefs different. These same deleted records should be inserted in the table Works_Operation_Rota_Excluida.
    Step 6: Deleted records Works_Operation table must also be deleted from the table Works_Op_Char. Fields of connection between these two tables are: Works_Order_No, Version_No, Works_Op_No, Alternate_Pref and Op_Proc_No. Deleted records will be recorded in the table Works_OP_Char_Rota_Excluida.

    I did not offer an opinion.
    You have what is called a technical or program specification. It describes the programming steps that need to be designed and written. This is exactly what programmers do. And your seeming inability to do this, points to the fact that you are not a programmer. That is the issue you need to address - instead of looking for so-called algorithmic logic.
    Simple and basic approach. Take step 1. Write SQL code that satisfies the requirements and outputs of that step. E.g.
    Step 1: Find Table MP_WO_REP which records have sales order number 18669437-20.
    Code: select * from mp_wo_rep where sales_order = '18669437-20'
    Do the same for step 2. And the remaining steps
    You now have the basic code template required to perform these steps. The next actions are:
    Modularising the code (instead of a hardcoded sales order number, support specifying it as a parameter).
    Simplify the code (by combining and integrating processing steps). Real programming is said to be the act of removing program source code statements, and not writing them.

  • Prime Number Loop Help

    I have used some code and written a program that asks the user for a number and it checks to see if it is prime or not. The program works fine, but I need it to loop and ask for another number or to exit. Here is my code and what my teacher has suggested to do, but I dont understand how to do this.
    This program checks to see if a number is prime or not. I got a lot of help on the Java Sun Forums.
    import java.io.*;
    public class Prime
    public static void main(String[] args)
    System.out.print("Enter a number: ");
    String input = readInput();
    int number = Integer.parseInt(input);
    int divisor = 2;
    int numberbytwo = number / 2;
    // Sets the factor to false uses loop to test
    boolean primen =false;
    while( divisor <= numberbytwo )
    if (number % divisor == 0)
    primen = true;
    break;
    divisor = divisor + 1;
    if( primen )
    System.out.println( number + " is NOT a prime number");
    else
    System.out.println( number + " is a prime number");
    Input method
    private static String readInput()
    try
    BufferedReader keyboard = new BufferedReader(new InputStreamReader(System.in));
    return keyboard.readLine();
    catch (IOException e) {}
    return "";
    What you have done is absolutely right...If you want to keep the user in the loop after the first check, you can do it and it is quite easy. Move the prompting for a number etc..to another function just the readInput() method...call it maybe askUser() or something.....
    and then in your below logic:
    if( primen )
    System.out.println( number + " is NOT a prime number");
    // ASK THE USER IF HE/SHE wants to continue. If yes call the askUser() method....
    else
    System.out.println( number + " is a prime number");

    It is, Jim. But not as we know it...Enlighten me 'o learned one, how should it be then??? Well, my comment suggested that the language wasn't standard,
    not that it should be.
    That's not a quibble: for what it's worth, I think fully spelt out words are
    probably a good thing in an international forum with many members for
    whom English is not their first language. And that care and
    attention to language is important both for describing problems and
    their solutions, and for coming up with something acceptable to the
    compiler. But more important than either of these, is the need to
    communicate, and to help.
    You were doing both of these. And I wasn't. So I shouldn't have
    stomped on your thread. For that I am sorry.
    (But destin started it! And it's "Enlighten me, oh learned one; how, then,
    should it be?")

  • Cooley turkey FFT Algorithm Help

    Hello fellow java people, I am trying to understand the adaptation of the cooley Turkey algorithm in the link below.
    http://www.cs.princeton.edu/introcs/97data/FFT.java.html
    One of the main things that i dont understand is the complex object which is being used. I may have overlooked it when I was reviewing the code but I cannot see the complex object anywhere.
    Can someone please tell me where if any where it is defined as I need to know what the input for this algorithm would be.
    Cheers in advance

    found out by myself, complex.java in different part.

  • Simple algorithm help to replace hardcoding

    How can this be simplified into simple algorithm?
    public void AI() {
            count++;
            if (count > 4 && randomMoveDecider() == true) {
                randomMove();
            } else if (buttons[1].getText().equals("O") && buttons[2].getText().equals("O") && buttons[3].getText().equals("")) {
                buttons[3].setText("O");
                buttons[3].setEnabled(false);
                board.setButton3("O");
            } else if (buttons[4].getText().equals("O") && buttons[5].getText().equals("O") && buttons[6].getText().equals("")) {
                buttons[6].setText("O");
                buttons[6].setEnabled(false);
                board.setButton6("O");
            } else if (buttons[7].getText().equals("O") && buttons[8].getText().equals("O") && buttons[9].getText().equals("")) {
                buttons[9].setText("O");
                buttons[9].setEnabled(false);
                board.setButton9("O");
            } else if (buttons[2].getText().equals("O") && buttons[3].getText().equals("O") && buttons[1].getText().equals("")) {
                buttons[1].setText("O");
                buttons[1].setEnabled(false);
                board.setButton1("O");
            } else if (buttons[5].getText().equals("O") && buttons[6].getText().equals("O") && buttons[4].getText().equals("")) {
                buttons[4].setText("O");
                buttons[4].setEnabled(false);
                board.setButton4("O");
            } else if (buttons[8].getText().equals("O") && buttons[9].getText().equals("O") && buttons[7].getText().equals("")) {
                buttons[7].setText("O");
                buttons[7].setEnabled(false);
                board.setButton7("O");
            } else if (buttons[1].getText().equals("O") && buttons[3].getText().equals("O") && buttons[2].getText().equals("")) {
                buttons[2].setText("O");
                buttons[2].setEnabled(false);
                board.setButton2("O");
            } else if (buttons[4].getText().equals("O") && buttons[6].getText().equals("O") && buttons[5].getText().equals("")) {
                buttons[5].setText("O");
                buttons[5].setEnabled(false);
                board.setButton5("O");
            } else if (buttons[7].getText().equals("O") && buttons[9].getText().equals("O") && buttons[8].getText().equals("")) {
                buttons[8].setText("O");
                buttons[8].setEnabled(false);
                board.setButton8("O");
            } else if (buttons[1].getText().equals("O") && buttons[4].getText().equals("O") && buttons[7].getText().equals("")) {
                buttons[7].setText("O");
                buttons[7].setEnabled(false);
                board.setButton7("O");
            } else if (buttons[2].getText().equals("O") && buttons[5].getText().equals("O") && buttons[8].getText().equals("")) {
                buttons[4].setText("O");
                buttons[4].setEnabled(false);
                board.setButton4("O");
            } else if (buttons[3].getText().equals("O") && buttons[6].getText().equals("O") && buttons[9].getText().equals("")) {
                buttons[9].setText("O");
                buttons[9].setEnabled(false);
                board.setButton9("O");
            } else if (buttons[4].getText().equals("O") && buttons[7].getText().equals("O") && buttons[1].getText().equals("")) {
                buttons[1].setText("O");
                buttons[1].setEnabled(false);
                board.setButton1("O");
            } else if (buttons[5].getText().equals("O") && buttons[8].getText().equals("O") && buttons[2].getText().equals("")) {
                buttons[2].setText("O");
                buttons[2].setEnabled(false);
                board.setButton2("O");
            } else if (buttons[6].getText().equals("O") && buttons[9].getText().equals("O") && buttons[3].getText().equals("")) {
                buttons[3].setText("O");
                buttons[3].setEnabled(false);
                board.setButton3("O");
            } else if (buttons[1].getText().equals("O") && buttons[7].getText().equals("O") && buttons[4].getText().equals("")) {
                buttons[4].setText("O");
                buttons[4].setEnabled(false);
                board.setButton4("O");
            } else if (buttons[2].getText().equals("O") && buttons[8].getText().equals("O") && buttons[5].getText().equals("")) {
                buttons[5].setText("O");
                buttons[5].setEnabled(false);
                board.setButton5("O");
            } else if (buttons[3].getText().equals("O") && buttons[9].getText().equals("O") && buttons[6].getText().equals("")) {
                buttons[6].setText("O");
                buttons[6].setEnabled(false);
                board.setButton6("O");
            } else if (buttons[1].getText().equals("O") && buttons[5].getText().equals("O") && buttons[9].getText().equals("")) {
                buttons[9].setText("O");
                buttons[9].setEnabled(false);
                board.setButton9("O");
            } else if (buttons[5].getText().equals("O") && buttons[9].getText().equals("O") && buttons[1].getText().equals("")) {
                buttons[1].setText("O");
                buttons[1].setEnabled(false);
                board.setButton1("O");
            } else if (buttons[1].getText().equals("O") && buttons[9].getText().equals("O") && buttons[5].getText().equals("")) {
                buttons[5].setText("O");
                buttons[5].setEnabled(false);
                board.setButton5("O");That is only some of it. :(
    But the point is for the AI to check the grid on a tic tac toe grid 3/3 and make the best move(win or stop wins)

    tjacobs01 wrote:
    private boolean buttonTest(JButton button1, JButton button2, JButton button3) {
    if (button1.getText().equals("O") && button2.getText().equals("O") && button3.getText().equals("")) {
    button3.setText("O");
    button3.setEnabled(false);
    return true;
    return false;Edited by: tjacobs01 on Dec 4, 2009 1:39 PMGreat ;)

  • WordSearch Solver Algorithm Help

    Hello, I am making a WordSearch solver. I have an algorithm, and I have it in code, but I can't figure out why it isn't working.
    Basically, I have a `List<List<String>>` that contains the WordSearch. I store that in a class called Grid, and in my Finder method use Grid.look() to find the words. The code is below (sorry for not commenting my code), and I would appreciate it if someone could tell me what is going wrong. The first Point (where each correct letter is) is always right, but none of the other ones are.
    Direction.java
    package com.wordsearchsolver;
    import java.awt.Point;
    public final class Direction {
         public static Directions NORTH = Directions.NORTH;
         public static Directions NORTHEAST = Directions.NORTHEAST;
         public static Directions EAST = Directions.EAST;
         public static Directions SOUTHEAST = Directions.SOUTHEAST;
         public static Directions SOUTH = Directions.SOUTH;
         public static Directions SOUTHWEST = Directions.SOUTHWEST;
         public static Directions WEST = Directions.WEST;
         public static Directions NORTHWEST = Directions.NORTHWEST;
         private static enum Directions {
              NORTH, NORTHEAST, EAST, SOUTHEAST,
              SOUTH, SOUTHWEST, WEST, NORTHWEST
         public static Point getDirection(Directions d) {
              Point p = new Point();
              switch (d) {
              case NORTH:
                   p.setLocation(0, 1);
                   break;
              case NORTHEAST:
                   p.setLocation(1, 1);
                   break;
              case EAST:
                   p.setLocation(1, 0);
                   break;
              case SOUTHEAST:
                   p.setLocation(1, -1);
                   break;
              case SOUTH:
                   p.setLocation(0, -1);
                   break;
              case SOUTHWEST:
                   p.setLocation(-1, -1);
                   break;
              case WEST:
                   p.setLocation(-1, 0);
                   break;
              case NORTHWEST:
                   p.setLocation(-1, 1);
                   break;
              return p;
    }Grid.java
    package com.wordsearchsolver;
    import java.awt.Point;
    import java.util.ArrayList;
    import java.util.Iterator;
    import java.util.List;
    public class Grid {
         private List<List<String>> mapByCollumn;
         private Point index;
         public Grid(List<List<String>> mapByCollumn) {
              this.mapByCollumn = mapByCollumn;
              this.index = new Point(0,0);
         public String traverse(Point p) {
              if ((index.x+p.x) >= 0 && (index.y+p.y) >= 0 && (index.y+p.y) < mapByCollumn.size() && (index.x+p.x) < mapByCollumn.get((index.y+p.y)).size())
                   index.setLocation(index.x+p.x, index.y+p.y);
              else return "";
              return mapByCollumn.get(index.y).get(index.x);
         public String look(Point p) {
              if ((index.x+p.x) >= 0 && (index.y+p.y) >= 0 && (index.y+p.y) < mapByCollumn.size() && (index.x+p.x) < mapByCollumn.get((index.y+p.y)).size())
                   return mapByCollumn.get(index.y+p.y).get(index.x+p.x);
              return "";
         public List<Point> getStartingPoints(String letter) {
              Iterator<List<String>> mapIterator = mapByCollumn.iterator();
              List<Point> startingPoints = new ArrayList<Point>();
              int mapCount      = 0;
              while (mapIterator.hasNext()) {
                   Iterator<String> wordIterator = mapIterator.next().iterator();
                   int wordCount      = 0;
                   while (wordIterator.hasNext()) {
                        String str = wordIterator.next();
                        if (str.equals(letter))
                             startingPoints.add(new Point(mapCount, wordCount));
                        wordCount++;
                   mapCount++;
              return startingPoints;
         public Point getIndex() {
              return index;
         public void setIndex(Point p) {
              index.setLocation(p);
    }Finder.java
    package com.wordsearchsolver;
    import java.awt.Point;
    import java.util.ArrayList;
    import java.util.Iterator;
    import java.util.List;
    public class Finder {
         private Grid grid;
         private List<Point> answerList;
         private List<List<String>> mapByCollumn;
         private Point direction;
         protected String word = "";
         public Finder(List<List<String>> mapByCollumn) {
              this.mapByCollumn     = mapByCollumn;
              grid                     = new Grid(mapByCollumn);
              answerList               = new ArrayList<Point>();
         public void find() {
              List<Point> startingPoints = grid.getStartingPoints(""+word.charAt(0));
              Iterator<Point> startingIterator = startingPoints.iterator();
              System.out.println(startingPoints);
              while (startingIterator.hasNext()) {
                   Point p = startingIterator.next();
                   grid.setIndex(p);
                   boolean go = false;
                   for (int i = 1; i < word.length(); ++i) {
                        if (!go) {
                        if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.NORTH)))) {
                             grid.traverse(Direction.getDirection(Direction.NORTH));
                             answerList.add(grid.getIndex());
                             direction = Direction.getDirection(Direction.NORTH);
                             continue;
                        if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.NORTHEAST)))) {
                             grid.traverse(Direction.getDirection(Direction.NORTHEAST));
                             answerList.add(grid.getIndex());
                             continue;
                        if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.EAST)))) {
                             grid.traverse(Direction.getDirection(Direction.EAST));
                             answerList.add(grid.getIndex());
                             continue;
                        if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.SOUTHEAST)))) {
                             grid.traverse(Direction.getDirection(Direction.SOUTHEAST));
                             answerList.add(grid.getIndex());
                             continue;
                        if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.SOUTH)))) {
                             grid.traverse(Direction.getDirection(Direction.SOUTH));
                             answerList.add(grid.getIndex());
                             continue;
                        if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.SOUTHWEST)))) {
                             grid.traverse(Direction.getDirection(Direction.SOUTHWEST));
                             answerList.add(grid.getIndex());
                             continue;
                        if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.WEST)))) {
                             grid.traverse(Direction.getDirection(Direction.WEST));
                             answerList.add(grid.getIndex());
                             continue;
                        if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.NORTHWEST)))) {
                             grid.traverse(Direction.getDirection(Direction.NORTHWEST));
                             answerList.add(grid.getIndex());
                             continue;
                        else if (go) {
                             if ((word.charAt(i)+"").equals(grid.look(direction))) {
                                  grid.traverse(direction);
                                  answerList.add(grid.getIndex());
                                  continue;
                        answerList.clear();
                        go = false;
                        break;
                   if (!answerList.isEmpty()) {
                        answerList.add(0, p);
                        break;
         public List<Point> getAnswerList() {
              return answerList;
    }

    First, that's way too much code. You should be writing and testing individual small pieces independently, and then hooking them together once they work. It's much easier to find a problem in a small bit of code than in a lot of code. Narrow down where the problem is occurring and provide an [url http://sscce.org]SSCCE that demonstrates it.
    Second, all you've said is "doesn't work." You need to provide details about exactly what is going wrong.

  • Quick-Sort Algorithm HELP !!!

    hi there, I wrote a method to sort an 2D-Vector. I used the Bubble-Algorithm.
    Here the code:
    Vector == [Micky, Niko, Tete] ; [Lilo, Eli, Micha];
    public static void bubbleSort( Vector v,
    int sortColumn,
    boolean ascending )
    int i = 0,
    j = 0,
    length = v.size();
    Vector tmp1,
    tmp2;
    for (i = 0; i < (length - 1); i++)
    for (j = i+1; j < length; j++)
    tmp1 = (Vector) v.elementAt(i);
    tmp2 = (Vector) v.elementAt(j);
    if (SortUtil.isGreaterThan(tmp1.elementAt(sortColumn), tmp2.elementAt(sortColumn)) > 0)
    // swap
    SortUtil.swap2D(v, i, j);
    public class SortUtil
    public static int isGreaterThan(Object obj1, Object2)
    // String
    if ( (obj1 instanceof String) && (obj2 instanceof String) )
    return ( ((String) obj1).compareTo((String) obj2) );
    public static void swap2D(Vector v, int i)
    Vector tmp = (Vector) v.elementAt(i);
    v.setElementAt((Vector) v.elementAt(i+1), i);
    v.setElementAt(tmp, i+1);
    I want now to write a method to use the quick-sort-algorithm.
    How can I do this.
    thanks a lot.
    micky z.

    Hi
    You can use java.util.Arrays.sort() method to sort an array of data in quick sort algo. May be you will have to use a n array insted of the Vector.
    Use vector.toArray() method to get an array from the vector.
    But if you want to use a dynamically resizing container like the Vector, use a java.util.LinkedList insted of the Vector and use Collections.sort() method
    Good luck.

Maybe you are looking for