Graph Implementations.java

// Implementazione dei grafi in lista delle adiacenze e matrice delle adiacenze

class Vertex<V>
    {
    V elem;
    int pos;
    ArrayList<Edge<E>> incidentEdges; // Solo in lista delle adiacenze
    public Vertex(V elem);
    public V getElem();
    public int getPos();
    public addAdjacent(Vertex v);
    }

class Edge<E>
    {
    E elem;
    int pos;
    Vertex left;
    Vertex right;
    public Edge(Vertex left, Vertex right);
    public Edge(Vertex left, Vertex right, E elem);
    public E getElem();
    public int getPos();
    }

class Graph<V, E>
    {
    ArrayList<Vertex<V>> vertices;
    ArrayList<Edge<E>> edges;
    Edge<E>[][] adjMatrix; // Solo in matrice delle adiacenze
    public Graph();
    public Graph(V elem);
    public List<Vertex<V>> vertices();
    public List<Edge<E>> edges();
    public Vertex insertVertex(V elem);
    public Edge insertEdge(Vertex left, Vertex right);
    public Vertex removeVertex(V elem);
    public Edge removeEdge(E elem);
    public Vertex opposite(Edge e, Vertex u);
    public boolean areAdjacent(Vertex u, Vertex v);
    public List<Edge<E>> incidentEdges(Vertex u);
    }