package com.company;
import java.util.Set;
import java.util.TreeSet;
/**
* Created by ev on 16-03-2016.
*/
public class Graph {
Set<Vertice> vertices = new TreeSet<>();
public boolean addVertice(Vertice v)
{
return vertices.add(v);
}
public boolean addNonDirectionalEdge(Vertice v1, Vertice v2)
{
if (vertices.contains(v1) && vertices.contains(v2))
{
Edge e = new Edge();
e.setDest(v2);
v1.edges.add(e);
Edge e2 = new Edge();
e2.setDest(v1);
v2.edges.add(e2);
}
return false;
}
}