I am using the following code: But doesn't work fine. I try to find the Minimum spanning and print it out from house to which hose.
public class MinimumSpanning {
public static void main(String[] args) {
// [][] edge= are price between each hose edgs.
int [][] edge= {{0,7,9,12,0,0,0},
{7,0,0,10,0,0,0},
{10,0,0,12,0,0,0},
{12,10,12,0,11,0,10},
{0,0,0,11,0,4,8},
{0,0,0,0,4,0,6},
{0,0,0,10,8,6,0}};
[code]....
It should only print one time. Example between K to L prints many time.
I'm new to Java and I'm trying to create a spanning tree in the desired order with 4 nodes (0,1,2,3). I've got the following code:
import java.util.ArrayList; public class A { public static boolean any(ArrayList<Integer> input) //To check for if any element in the ArrayList == 1 { boolean answer = false; for(int i=0;i<input.size();i++) { if(input.get(i)==1)
[Code] ....
What happens is that the input parameter adj and hence the original adjmat inside main gets changed everytime I enter the method "connected", and I don't want this to happen. I understand that this is due to the main method being static and hence adjmat becomes static as well, but how do I change the code such that adjmat only gets modified after coming out of the connected function, and not while inside it?
I finished a game in Java and sent it to a friend. Launching the program in my computer worked just fine.
But he got this error : "Could not find the main classs: Main. program will exit"
My JRE version is the most updated one. His JRE was version 1.6. He updated his JRE, and the problem was solved.
This is a bit worrying for me, because as far as I know, 1.6 isn't a very old version of the JRE. It's not the most recent one, but not that old.
This is worrying because I'm planning on sending my game to a lot of friends, and trying to distribute it on the internet.
A lot of people don't have the most updated JRE. And they are mostly non-programmers, so I can't expect them to update to the newest version of Java upon downloading my game. They might not know what Java is, even though they got it on their computer, and upon receiving an error, they'll just give up on the game.
If my game wouldn't work with a significantly old JRE, that would be reasonable. It's part of the nature of working with Java. But the fact that a relatively updated JRE, 1.6, doesn't work with my game, is worrying.
*(Please note: My game isn't implementing anything "special". Swing and KeyBindings are the 'newest' additions to Java that I can think of inside my game)*.
In short, I'd like to know that my game works on most of the computers it tries to run on. Knowing that it doesn't work on a relatively new JRE, is worrying.
So I have two questions:
1. Is it normal, for a Java program, to have such "high" demands for the JRE version? Do a lot of Java games demand at least version 1.6 of the JRE? Is this common?
2. How can I find out the minimum JRE version requirement for my program? Is there a methodical way to do this, or do I just have to go through all the libraries I use in my game and figure out what's the JRE release version for each one?
I'm required to create a program that finds the minimum value in an Array of integers.
Here is my approach :
public class Person { public static void main(String [ ] args){ int theArray[]=new int [10]; int result = 0; for (int i:theArray){ if (i < Integer.MAX_VALUE)
[Code]...
I can't really progress from this position. I keep getting told to change the return type to int on main method, then when i do it says change it to void..
I was given some code by a professor to add some features to as part of an assignment. However, the code itself doesn't seem to work.
import java.util.HashSet; import java.util.InputMismatchException; import java.util.PriorityQueue; import java.util.Scanner; import java.util.Set; public class DijkstraPriorityQueue
[Code] ....
The method to find minimum distance is nonfunctional...I receive an error that the types are incompatible. I can't do the assignment if the base code doesn't work to begin with...
How to do draw the original binary tree based on traversal results?
A binary tree has this pre-order traversal result: A,B,D,H,I,E,F,C,G,K,J (TreeNodes) And the same tree gives the following in-order traversal: B,H,I,D,A,C,F,E,K,G,J. Can you draw the tree structure?
I have some work where I have to create a binary tree. Anyway I am stuck on one of the classes which has several methods I must fill in! The code is below
The headers for each method are: public Node find (member p1)The method find(Member p1) is used to return the node which contains a particular member. It is a private method because the interface to CabinetTree should not provide direct access to the internal nodes. It makes use of the method Node findNode (Member p1, Node current)
and the next method is : Node findNode(Member p1, Node current) which searches the tree from current node to find a node whose value is equal to the Member p1, i.e. a node in the tree such that p1.equals(current.getMember()) is true. If there is no such node then the method should return null.
public class CabinetTree { private Node head; CabinetTree(Member p1) { head = new Node(p1, null);
I used tomahawk t:tree for showing my data in tree structure and displayed that very fine. But my problem is how can we find the node id in bean side when we select one node .Because i want to show some data based on that node.
how to create a tree data structure in java.I tried with a class consisting of node field and arraylist child nodes. but it does not satisfy the requirement.the requirement is that,
My task is to implement a B-Tree data structure in Java using no libraries.
My current problem is inserting when the root is full, thus the middle key goes to root.keys[0] and then it get the left and right side which are new Nodes separating and inserting their keys. My problem is that for some reason there is a random second number when in the root and secondly my boolean leaf is always false meaning it never detects that the Tree is deeper than root.
The coding makes sense to me and I have tried printing everywhere but still can't seem to find the problem.
public class BTree { /* 1. You may not modify the public interface of this class. You may however add any additional methods and/or field which you may require to aid you in the completion of this assignment.
2. You will have to design and implement a Node class. The BTree should house Integer objects.
3. You will notice that there are some overloaded methods, some of which work for Integer objects and some with primitive type int. You have to find a way to implement the methods to work with both types. */
class BTreeNode { boolean leaf = true; int numKeys = 1; int mOrder; Integer keys[];
My task is to implement a B-Tree data structure in Java using no libraries.
My current problem is inserting when the root is full, thus the middle key goes to root.keys[0] and then it get the left and right side which are new Nodes separating and inserting their keys. My problem is that for some reason there is a random second number when in the root and secondly my boolean leaf is always false meaning it never detects that the Tree is deeper than root.
The coding makes sense to me and I have tried printing everywhere but still can't seem to find the problem.
public class BTree { /* 1. You may not modify the public interface of this class. You may however add any additional methods and/or field which you may require to aid you in the completion of this assignment. 2. You will have to design and implement a Node class. The BTree should house Integer objects. 3. You will notice that there are some overloaded methods, some of which work for Integer objects and some with primitive type int. You have to find a way to implement the methods to work with both types. */
class BTreeNode { boolean leaf = true; int numKeys = 1; int mOrder; Integer keys[];
I have written a code to get all the nodes below a current Node and it is working but I need to get it to look better if possible. To get the number of nodes below I have created an Array List, which I then go to the first Node below and add all the people to the Array list on the same level till I get to the end of the level, then I go down again until I cannot go down any more. Is there a way I can have my code without having to use an array List? I have put my code below. The brieff about the tree is that you have a parent and below the Parent are children who can have brothers and sisters next to them and after that they also have children below that. The method is trying to find the number of children below any given child
private LinkedList<Node> TempQueue = new LinkedList<Node>(); public int noOfYoungerChildren(Member p1){ Node tmp = find(p1); return countYoungerChildren(tmp);
I never used tree, node etc. Consider an array of strings that come from html tags. This needs to be turned into a tree structure. Here, any Hn is the child of the most recent Hn-1
I am trying to drag and drop tree nodes within the same JTree. I have a code which uses Java 1.2 java.awt.dnd.I would like to use TransferHandler and newer implementation.I have found a code which works when JTree is drop target but there is no code where Jtree is drag source and drop target.
I Write a Java program to parse a syntactically correct arithmetical expression and produce an equivalent Expression TREE. Remember, in an expression tree the terminal nodes are variables and constants, and the interior nodes are operators (such as +,-,*,/).
For instance the expression: (1 + 2) * 3 can be represented by the following tree:
But when i Execute the program it Shows only Prefix and postfix .But the requered output is in inorder preorder and postorder so how to solve these error
import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException; import java.util.Scanner; import javax.swing.tree.TreeNode; public class InToPost { private static String str;
The second message dialog result is always 0 ... i want to find the minimum grade...
import javax.swing.*; import java.util.Arrays; public class Parrarrapapa{ public static void main (String[]args){ String length = JOptionPane.showInputDialog("Number of students");
i need to calculate the minimum and the maximum, actually it seems to be easy but, the minimum should be the smallest number but 0..this is my code
Java Code:
Scanner s = new Scanner (System.in); int max = 0 ; int min = 0 ; System.out.println(" Please enter 3-5 numbers"); int a = s.nextInt(); int b = s.nextInt(); int c = s.nextInt(); int d = s.nextInt(); int e = s.nextInt();
I am writing a code based on the following question: "Write a method called arrayMin that accepts as an argument an array of numbers and returns the minimum value of the numbers in that array.Create an array to test your code with and call the method from main to print the min to the screen".
I cannot seem to get the code to calculate the minimum number.
Here is my progress thus far:
import java.util.*; public class Lab11q3 { public static void main(String[] args) { Scanner console = new Scanner(System.in); int number;
I'm almost finished with my assignment, I'm just having one small issue. The goal of this assignment is to have a user input as many values they want(up to 10) into a list. I need to store those in an array then figure out the sum of the numbers, the average, the Largest value, and the smallest value. I get everything to print out correct so far except for the Smallest number, it is returning a 0 every time. Here is my code:
import java.util.Scanner; public class SimpleList{ Scanner in = new Scanner(System.in); final private static int ARRAY_LENGTH = 10; private float[] List = new float[ARRAY_LENGTH]; private int count = 0;
I am doing a homework assignment for a class I'm taking and writing a java program that finds the smallest and largest number in an array entered by the user. For some reason no matter what I enter as the smallest number it returns 0 as the smallest. I'm not sure what I have done wrong. Here is my code:
import javax.swing.JOptionPane; public class MinimumAndMaximumJamesBulow { public static void main(String[] args) { int minimum = 0; int maximum = 0;
I have to return the minimum and maximum value entered by the user, so far the program returns the maximum but the minimum stays at 0. I assigned 0 to the min and max variables. I believe that is part of the problem, but why do I get an accurate answer on the max if both variables are assigned to 0?
int min = 0; int max = 0; int option = JOptionPane.YES_OPTION; while ( option == JOptionPane.YES_OPTION){ String dataString = JOptionPane.showInputDialog("Enter an integer"); int data = Integer.parseInt(dataString); if ( min > Integer.parseInt(dataString)) min = Integer.parseInt(dataString); if ( max < Integer.parseInt(dataString)) max = Integer.parseInt(dataString); option =JOptionPane.showConfirmDialog(null, "Continue?"); } JOptionPane.showMessageDialog(null, "Minimum: " + min + " Maximum: " + max); }
