Algorithm for searching graph-like data structures, one level at a time.
- Start a queue
- Check current node - if false, mark as visited, continue
import java.awt.*; | |
import java.awt.event.*; | |
import javax.swing.*; | |
import javax.swing.event.*; | |
import javax.swing.text.html.*; | |
public class SwingHTMLBrowser extends JFrame implements ActionListener, HyperlinkListener { | |
private JTextField addressBar; | |
private JEditorPane pane; |
import java.awt.Font; | |
import java.awt.event.KeyAdapter; | |
import java.awt.event.KeyEvent; | |
import javax.swing.InputMap; | |
import javax.swing.JFrame; | |
import javax.swing.JScrollPane; | |
import javax.swing.JTextArea; | |
import javax.swing.KeyStroke; | |
import javax.swing.SwingUtilities; |
// create global variable | |
int xx=0; | |
int yy=0; | |
// add mouse presesd event listner on the component you want to make dragger | |
private void jPanel1MousePressed(java.awt.event.MouseEvent evt) { | |
xx=evt.getX(); | |
yy=evt.getY(); | |
} | |