MinecraftHDL

package MinecraftGraph;

import java.util.ArrayList;

public class Graph {
	
	//only input vertices
	private ArrayList<Vertex> vertices;
	
	public Graph(){
		vertices=new ArrayList<>();
	}
	
	
	public void addVertex(Vertex v){
			vertices.add(v);
	}
	
	
	public void addEdge(Vertex v1, Vertex v2){

		if (v2.type == VertexType.FUNCTION){
			Function f = (Function) v2;
			if (f.func_type == FunctionType.MUX){
				MuxVertex m = (MuxVertex) f;

			}
		}

		v1.addToNext(v2);
		v2.addToBefore(v1);
	
		
	}
	
	
	public void removeEdge(Vertex v1, Vertex v2){
		v1.removeNext(v2);
		v2.removeBefore(v1);
	}
	
	public void removeVertex(Vertex v){
		//remove v from all neighbors
		
		for(Vertex ver: vertices){
			ver.removeNext(v);
			ver.removeBefore(v);
		}
		//remove v from vertices list
		vertices.remove(v);
		
	}
	
	//This function takes the inputs to the first vertex v1 and adds them to v2
	public void mergeVertices(Vertex v1, Vertex v2){
		
		
		//v1 is to be merged(source)
		for(Vertex v: v1.getBefore()){
			v2.addToBefore(v);
			v.addToNext(v2);
		}
		
		
		
	}
	
	public ArrayList<Vertex> getVertices(){
		
		return vertices;
		
	}

	public void print(){
		System.out.println(this.vertices.size());

		for (Vertex v : this.vertices){
			v.print();
		}
	}
}