|
never mind Sir,
But, thanx for your help..
|
|
|
|
|
Why not?
Let as say A connects to be B and B to C
A sends a message "C do X" to B.
B gets the message and forwards it C.
This is how a peer-to-peer network works. If you receive a message for someone else you forward it to the next person.
You may need to set up some tables so that when A needs to send a message, he knows which of his connections to send it via.
Good luck.
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
every node (mobile->laptop device) act as a router and node C also can do that connection.
So, the topology of network not like peer to peer. It means that not only one router and another as a client, but, every node is a router.
|
|
|
|
|
Nobody can help me?..
Please....
|
|
|
|
|
Susy Nainggolan wrote: Nobody can help me?..
With what? As I said earlier I can see nothing here about Java.
Binding 100,000 items to a list box can be just silly regardless of what pattern you are following. Jeremy Likness
|
|
|
|
|
Your question is not clear.
You have 3 computers: A, B and C.
A uses a socket to connect to B. Then A sends a message.
At that point A is done. It no longer controls in any way shape or form what happens on B.
So if you want to send a message from A to C via B then you MUST do the following.
1. Create a client App that runs on A. Call this AppM.
2. Create a server App that runs on B. It accepts messages from ANY client (anyone that connects to it) and then it sends those to C. Call this AppS.
3. Create a service App on C that accepts messages from ANY client. Call this AppZ.
So the message flow is then AppM -> AppS -> AppZ.
The above is basically how routers work with some differences. However each router still has an App on it.
|
|
|
|
|
Please help to do the above task
|
|
|
|
|
Homework is supposed to be done by yourself.
We can help you, but we do not provide solutions to homework.
So please try to do it yourself. If problems occur you're welcome to come back and ask specific.
|
|
|
|
|
The expression to search for is "chained combobox".
|
|
|
|
|
hmm, doesn't lead this into a false direction?
I guess the task is on basic use of combo boxes...
|
|
|
|
|
HI, IAM FINDING LLAMMAWORK2D ANY ONE WHO CAN HELP ME
|
|
|
|
|
|
That last link is really great!
|
|
|
|
|
hello 
I'd like to make a web service that allows to find the shortest path between bus stations with Dijkstra's algorithm, then the path will be displayed on a map. (I have a database that contains the coordinated stations) but I do not know "how to start": , I am really blocked for a week and i dont find any thing  , i dont find a tutorials as this subject
( This web service will be used by my android application)
realy i need help
(i use eclipse)
thank you in advance
|
|
|
|
|
0. Build a web server. Get your server up and running, maybe get it up and running so the user can enter two places and the service replies "Cannot calculate route from X to Y; please try later when the code is done."
1. Build your algorithm. Seperate to the web bits, make sure you can calculate the route. Use command line and have a call like Points[] getRoute(String from, String to), get that working.
2. plug #1 into #1
3. Magic.
4. Profit!
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
think you for your help but i still have a problem  .
So i should create a web service wich will communicate with my android application .in my android app the client choose two point start and arrival this two point will be send to my web service to find the bus that has the shortest path between them.
i have a problem analytically and programmatically i find a dijkstra algorithme in this link http://www.vogella.com/code/de.vogella.algorithms.dijkstra/codestartpage.html
and i find this also http://www.codeweblog.com/dijkstra-shortest-path-algorithm-to-optimize-combat/
can you help me wich one i choose and how can i establish a relationship between this algorithme and my data base may be i need to send or retrieve the bulk of data in arraylist.. ..what are the classes needed what is the query that i need.. in wich classe i write them..
(i use eclipse ide )
thanks in advance
|
|
|
|
|
What would you do in this web services?U can select all the database thoroughout MS Sql and link to your code in Java?IS it possible?
|
|
|
|
|
think you for your help but i still have a problem .
So i should create a web service wich will communicate with my android application .in my android app the client choose two point start and arrival this two point will be send to my web service to find the bus that has the shortest path between them.
i have a problem analytically and programmatically i find a dijkstra algorithme in this link http://www.vogella.com/code/de.vogella.algorithms.dijkstra/codestartpage.html
and i find this also http://www.codeweblog.com/dijkstra-shortest-path-algorithm-to-optimize-combat/
can you help me wich one i choose and how can i establish a relationship between this algorithme and my data base may be i need to send or retrieve the bulk of data in arraylist.. ..what are the classes needed what is the query that i need.. in wich classe i write them..
(i use eclipse ide )
thanks in advance
|
|
|
|
|
Hello,
I have a JTextArea in a panel,I am reducing its bounds and then printng it to graphics object.
But there is a problem with it the text on the right border gets cut...i am unable to understand why is it so.
|
|
|
|
|
Example code helps.
There could be any one of a thousand reasons it doesn't work, without code it is impossible to help.
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
jComp.setBounds((int)Math.round(rectangle.getX()),
(int)Math.round(rectangle.getY()),
(int)rect.getWidth(), (int)rect.getHeight());
java.awt.Font font = fontSizeMap.get(jComp);
-------//jcomp is a jtextfield
jComp.print(graphics2D);
|
|
|
|
|
your problem is right in front of you, you are changing size of textAREA but i can't see font rules.
if you cant solve it, you might missed something.....
modified 27-Apr-12 7:16am.
|
|
|
|
|
I write a class ThreadPool that is extend from ThreadPoolExcutor. When I use it, I print out the result of CompletedTask after shutdown the ThreadPool, but it always not equal the total number of tasks.
I don't know why, please help me
|
|
|
|
|
I would hazard a guess that you have written non-thread safe code. Without seeing the code it would be very difficult to tell.
Look for updates and/or logic that relies on value that is accessed across multiple threads, this code will need to be synchronized to ensure it is safe.
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
I am trying to write java code for querying ontology by sparql with jena .....but i search and I didn't find code
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
