com.eduworks.ec.graph.EcDirectedGraph Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of ec.base Show documentation
The newest version!
package com.eduworks.ec.graph;

import com.eduworks.ec.array.EcArray;
import org.stjs.javascript.Array;

/**
 * A directed implementation of {{#crossLink "Graph"}}Graph{{/crossLink}}. Edges have types. Two vertices may have many edges between them.
 *
 * @param 
 * @param 
 * @author fray
 * @class EcDirectedGraph
 * @module com.eduworks.ec
 * @extends Graph
 */
public abstract class EcDirectedGraph implements Graph {
	Array> edges = null;
	Array verticies = null;

	public EcDirectedGraph(){
		edges = new Array<>();
		verticies = new Array<>();
	}

	@Override
	public Array getEdges() {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++)
			results.$set(i, edges.$get(i).edge);
		return results;
	}

	@Override
	public Array getVertices() {
		Array results = new Array<>();
		for (int i = 0; i < verticies.$length(); i++)
			results.$set(i, verticies.$get(i));
		return results;
	}

	@Override
	public boolean containsVertex(V vertex) {
		for (int i = 0; i < verticies.$length(); i++)
			if (vertex.equals(verticies.$get(i)))
				return true;
		return false;
	}

	@Override
	public boolean containsEdge(E edge) {
		for (int i = 0; i < edges.$length(); i++)
			if (edge.equals(edges.$get(i).edge))
				return true;
		return false;
	}

	@Override
	public int getEdgeCount() {
		return edges.$length();
	}

	@Override
	public int getVertexCount() {
		return verticies.$length();
	}

	@Override
	public Array getNeighbors(V vertex) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (vertex.equals(edges.$get(i).source))
				results.push(edges.$get(i).destination);
			else if (vertex.equals(edges.$get(i).destination))
				results.push(edges.$get(i).source);
		}
		EcArray.removeDuplicates(results);
		return results;
	}

	@Override
	public Array getIncidentEdges(V vertex) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (vertex.equals(edges.$get(i).source))
				results.push(edges.$get(i).edge);
			else if (vertex.equals(edges.$get(i).destination))
				results.push(edges.$get(i).edge);
		}
		EcArray.removeDuplicates(results);
		return results;
	}

	@Override
	public Array getIncidentVertices(E edge) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (edge.equals(edges.$get(i).edge)) {
				results.push(edges.$get(i).source);
				results.push(edges.$get(i).destination);
			}
		}
		EcArray.removeDuplicates(results);
		return results;
	}

	@Override
	public E findEdge(V v1, V v2) {
		for (int i = 0; i < edges.$length(); i++) {
			if (v1.equals(edges.$get(i).source) && v2.equals(edges.$get(i).destination))
				return edges.$get(i).edge;
			if (v1.equals(edges.$get(i).destination) && v2.equals(edges.$get(i).source))
				return edges.$get(i).edge;
		}
		return null;
	}

	@Override
	public Array findEdgeSet(V v1, V v2) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (v1.equals(edges.$get(i).source) && v2.equals(edges.$get(i).destination))
				results.push(edges.$get(i).edge);
			if (v1.equals(edges.$get(i).destination) && v2.equals(edges.$get(i).source))
				results.push(edges.$get(i).edge);
		}
		return results;
	}

	@Override
	public boolean addVertex(V vertex) {
		verticies.push(vertex);
		return true;
	}

	public boolean addVertexSafely(V vertex) {
		if (EcArray.has(verticies,vertex))
			return false;
		verticies.push(vertex);
		return true;
	}

	@Override
	public boolean removeVertex(V vertex) {
		int indexOf = EcArray.indexOf(verticies,vertex);
		if (indexOf != -1) {
			for (int i = 0; i < edges.$length(); i++) {
				if (edges.$get(i).source.equals(vertex) || edges.$get(i).destination.equals(vertex)) {
					edges.splice(i, 1);
					i--;
				}
			}
			verticies.splice(indexOf, 1);
			return true;
		}
		return false;
	}

	@Override
	public boolean removeEdge(E edge) {
		boolean success = false;
		for (int i = 0; i < edges.$length(); i++) {
			if (edges.$get(i).edge.equals(edge)) {
				edges.splice(i, 1);
				i--;
				success = true;
			}
		}
		return success;
	}

	@Override
	public boolean isNeighbor(V v1, V v2) {
		for (int i = 0; i < edges.$length(); i++) {
			if (v1.equals(edges.$get(i).source) && v2.equals(edges.$get(i).destination))
				return true;
			else if (v1.equals(edges.$get(i).destination) && v2.equals(edges.$get(i).source))
				return true;
		}
		return false;
	}

	@Override
	public boolean isIncident(V vertex, E edge) {
		for (int i = 0; i < edges.$length(); i++) {
			if ((vertex.equals(edges.$get(i).source) || vertex.equals(edges.$get(i).destination)) && edge.equals(edges.$get(i).edge))
				return true;
		}
		return false;
	}

	@Override
	public int degree(V vertex) {
		int count = 0;
		for (int i = 0; i < edges.$length(); i++) {
			if (vertex.equals(edges.$get(i).source) || vertex.equals(edges.$get(i).destination))
				count++;
		}
		return count;
	}

	@Override
	public int getNeighborCount(V vertex) {
		return getNeighbors(vertex).$length();
	}

	@Override
	public int getIncidentCount(E edge) {
		return getIncidentVertices(edge).$length();
	}

	@Override
	public abstract String getEdgeType(E edge);

	@Override
	public abstract String getDefaultEdgeType();

	@Override
	public Array getEdgesOfType(String edge_type) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (getEdgeType(edges.$get(i).edge) == edge_type)
				results.push(edges.$get(i).edge);
		}
		return results;
	}

	@Override
	public int getEdgeCountOfType(String edge_type) {
		return getEdgesOfType(edge_type).$length();
	}

	@Override
	public Array getInEdges(V vertex) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (vertex.equals(edges.$get(i).destination))
				results.push(edges.$get(i).edge);
		}
		EcArray.removeDuplicates(results);
		return results;
	}

	@Override
	public Array getOutEdges(V vertex) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (vertex.equals(edges.$get(i).source))
				results.push(edges.$get(i).edge);
		}
		EcArray.removeDuplicates(results);
		return results;
	}

	@Override
	public int inDegree(V vertex) {
		return getInEdges(vertex).$length();
	}

	@Override
	public int outDegree(V vertex) {
		return getOutEdges(vertex).$length();
	}

	@Override
	public V getSource(E directed_edge) {
		for (int i = 0; i < edges.$length(); i++) {
			if (directed_edge.equals(edges.$get(i).edge))
				return edges.$get(i).source;
		}
		return null;
	}

	@Override
	public V getDest(E directed_edge) {
		for (int i = 0; i < edges.$length(); i++) {
			if (directed_edge.equals(edges.$get(i).edge))
				return edges.$get(i).destination;
		}
		return null;
	}

	@Override
	public Array getPredecessors(V vertex) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (vertex.equals(edges.$get(i).destination))
				results.push(edges.$get(i).source);
		}
		EcArray.removeDuplicates(results);
		return results;
	}

	@Override
	public Array getSuccessors(V vertex) {
		Array results = new Array<>();
		for (int i = 0; i < edges.$length(); i++) {
			if (vertex.equals(edges.$get(i).source))
				results.push(edges.$get(i).destination);
		}
		EcArray.removeDuplicates(results);
		return results;
	}

	@Override
	public boolean isPredecessor(V v1, V v2) {
		for (int i = 0; i < edges.$length(); i++) {
			if (v1.equals(edges.$get(i).destination))
				if (v2.equals(edges.$get(i).source))
					return true;
		}
		return false;
	}

	@Override
	public boolean isSuccessor(V v1, V v2) {
		for (int i = 0; i < edges.$length(); i++) {
			if (v2.equals(edges.$get(i).destination))
				if (v1.equals(edges.$get(i).source))
					return true;
		}
		return false;
	}

	@Override
	public int getPredecessorCount(V vertex) {
		return getPredecessors(vertex).$length();
	}

	@Override
	public int getSuccessorCount(V vertex) {
		return getSuccessors(vertex).$length();
	}

	@Override
	public boolean isSource(V vertex, E edge) {
		for (int i = 0; i < edges.$length(); i++) {
			if (edge.equals(edges.$get(i).edge))
				if (vertex.equals(edges.$get(i).source))
					return true;
		}
		return false;
	}

	@Override
	public boolean isDest(V vertex, E edge) {
		for (int i = 0; i < edges.$length(); i++) {
			if (edge.equals(edges.$get(i).edge))
				if (vertex.equals(edges.$get(i).destination))
					return true;
		}
		return false;
	}

	@Override
	public boolean addEdge(E e, V v1, V v2) {
		addVertexSafely(v1);
		addVertexSafely(v2);

		Triple t = new Triple<>();
		t.source = v1;
		t.destination = v2;
		t.edge = e;

		edges.push(t);
		return true;
	}

	public boolean addEdgeUnsafely(E e, V v1, V v2) {
		Triple t = new Triple<>();
		t.source = v1;
		t.destination = v2;
		t.edge = e;

		edges.push(t);
		return true;
	}

	public boolean addEdgeSafely(E e, V v1, V v2) {
		addVertexSafely(v1);
		addVertexSafely(v2);

		Triple t = new Triple<>();
		t.source = v1;
		t.destination = v2;
		t.edge = e;

		if (EcArray.has(edges,t))
			return false;

		edges.push(t);
		return true;
	}

	@Override
	public V getOpposite(V vertex, E edge) {
		for (int i = 0; i < edges.$length(); i++) {
			if (edge.equals(edges.$get(i).edge))
				if (vertex.equals(edges.$get(i).destination))
					return edges.$get(i).source;
				else if (vertex.equals(edges.$get(i).source))
					return edges.$get(i).destination;
		}
		return null;
	}

}