Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.ArrayList;
- import java.util.Collections;
- public class NodeList
- {
- private ArrayList<Node> nodes;
- public NodeList()
- {
- nodes = new ArrayList();
- }
- public void clear()
- {
- nodes.clear();
- }
- public Node getNode(int x, int y)
- {
- Node temp = new Node(x, y);
- for (int i = 0; i < nodes.size(); i++)
- {
- Node n = nodes.get(i);
- if (n.equals(temp))
- {
- return n;
- }
- }
- return null;
- }
- public Node getLast()
- {
- return nodes.get(nodes.size() - 1);
- }
- public void add(Node node)
- {
- nodes.add(node);
- }
- public boolean contains(Node node)
- {
- for (int i = 0; i < nodes.size(); i++)
- {
- if (nodes.get(i).equals(node))
- {
- return true;
- }
- }
- return false;
- }
- public boolean isEmpty()
- {
- return nodes.isEmpty();
- }
- public Node getSmallest()
- {
- int f = Integer.MAX_VALUE;
- Node smallestNode = null;
- for (Node node : nodes)
- {
- if (f > node.totalCost)
- {
- f = node.totalCost;
- smallestNode = node;
- }
- }
- remove(smallestNode);
- return smallestNode;
- }
- public void remove(Node node)
- {
- for (int i = 0; i < nodes.size(); i++)
- {
- if (nodes.get(i).equals(node) && nodes.get(i).parentNode == node.parentNode)
- {
- nodes.remove(i);
- return;
- }
- }
- }
- public Node remove(int index)
- {
- return nodes.remove(index);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement