Graphviewer/Graph.pde at master · mavd09/Graphviewer · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
import java.util.*;

public class Graph {
  TreeMap<Node, TreeSet<Integer>> adjacencyList;
  TreeMap<Integer, Edge> edges;

  boolean directedEdges;
  boolean weightedEdges;

  Graph() {
    adjacencyList = new TreeMap<Node, TreeSet<Integer>>();
    edges = new TreeMap<Integer, Edge>();
    directedEdges = false;
    weightedEdges = false;
  }

  public void reset() {
    for( Map.Entry<Node, TreeSet<Integer>> entry : adjacencyList.entrySet() ) {
      entry.getKey().setColor(Utility.DEFAULT_NODE_COLOR);
    }
  }

  public void removeEdge(Integer edgeId) {
    Edge edge = edges.remove(edgeId);
    adjacencyList.get(edge.getFrom()).remove(edge.getEdgeId());
    if(edge.getDirected() == false) {
      adjacencyList.get(edge.getTo()).remove(edge.getEdgeId());
    }
    edge.setDeleted(true);
  }

  public void addEdge(Edge edge) {
    adjacencyList.get(edge.getFrom()).add(edge.getEdgeId());
    if(edge.getDirected() == false) {
      adjacencyList.get(edge.getTo()).add(edge.getEdgeId());
    }
    edges.put(edge.getEdgeId(), edge);
  }

  public void setDirectedEdges( boolean directedEdges ) {
    this.directedEdges = directedEdges;
  }

  public void setWeightedEdges( boolean weightedEdges ) {
    this.weightedEdges = weightedEdges;
  }

  public boolean getDirectedEdges( ) {
    return directedEdges;
  }

  public boolean getWeightedEdges( ) {
    return weightedEdges;
  }

  public void removeNode(Node node) {
    adjacencyList.remove(node);
  }

  public void addNode(Node node) {
    adjacencyList.put(node, new TreeSet<Integer>());
  }

}