graph.ordering.circular

Class GraphCopy<V extends Vertex,E extends Edge<V>>

java.lang.Object

graph.elements.Graph<V,E>

graph.ordering.circular.GraphCopy<V,E>

Type Parameters:

V - The vertex type

E - The edge type

public class GraphCopy<V extends Vertex,E extends Edge<V>>
extends Graph<V,E>

A graph containing triangulated edges. Used to implement algorithm CIRCULAR

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
GraphCopy()
GraphCopy(java.util.List<V> vertices, java.util.List<E> edges)

Method Summary

Modifier and Type	Method and Description
TriangulatedEdge<V>	addTriangulatedEdge(V v1, V v2) Adds a triangulated edge between the given two vertices
java.util.List<V>	adjacentVerticesWithTriangulated(V v) Finds all vertices adjacent to the given vertex taking triangulated edges into account as well
java.util.List<Edge<V>>	allAdjacentEdgesWithTriangulated(V v) Finds all edges adjacent to the given vertex taking triangulated edges into account as well
java.util.List<Edge<V>>	edgeesBetweenWithTriangulated(V v1, V v2) Finds all edges between the given two vertices taking triangulated edges into account as well
boolean	hasEdge(V v1, V v2) Checks if vertices v1 and v2 are connected i.e.
void	removeEdgeWithTriangulated(Edge<V> e) Removes an edge from the graph, checking if it is a triangulated edge or a regular one
int	vertexDegree(V v) Number of edges entering or leaving v

Methods inherited from class graph.elements.Graph

addEdge, addVertex, addVertex, addVertexBeginning, adjacencyMatrix, adjacentEdges, adjacentVertices, allEdges, edgeBetween, edgeesBetween, edgesBetween, equals, getAdjacentLists, getAllSelfLoopEdges, getAllSinks, getAllSources, getEdges, getTreeLeaves, getVertexByContent, getVertices, graphMaxDegree, hashCode, hasSelfLoopEdges, hasVertex, inDegree, inEdges, isBiconnected, isConnected, isConnected, isCyclic, isDirected, isRing, isSimple, isSink, isSource, isTree, listBiconnectedComponents, listCutVertices, listMultiEdges, outDegree, outEdges, printAdjacencyMatrix, removeEdge, removeVertex, setDirected, setEdges, setVertices, subgraph, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

GraphCopy

public GraphCopy()

GraphCopy

public GraphCopy(java.util.List<V> vertices,
                 java.util.List<E> edges)

Method Detail

addTriangulatedEdge

public TriangulatedEdge<V> addTriangulatedEdge(V v1,
                                               V v2)

Adds a triangulated edge between the given two vertices

Parameters:

v1 - The first vertex

v2 - The second vertex

Returns:

Created triangulated edge

vertexDegree

public int vertexDegree(V v)

Description copied from class: Graph

Number of edges entering or leaving v

Overrides:

vertexDegree in class Graph<V extends Vertex,E extends Edge<V>>

Parameters:

v - Vertex

Returns:

Vertex degree of v

hasEdge

public boolean hasEdge(V v1,
                       V v2)

Description copied from class: Graph

Checks if vertices v1 and v2 are connected i.e. if there is an edge between them

Overrides:

hasEdge in class Graph<V extends Vertex,E extends Edge<V>>

Parameters:

v1 - Source vertex

v2 - Destination vertex

Returns:

true if there is and edge between v1 and v2, otherwise false

removeEdgeWithTriangulated

public void removeEdgeWithTriangulated(Edge<V> e)

Removes an edge from the graph, checking if it is a triangulated edge or a regular one

Parameters:

e - Edge

adjacentVerticesWithTriangulated

public java.util.List<V> adjacentVerticesWithTriangulated(V v)

Finds all vertices adjacent to the given vertex taking triangulated edges into account as well

Parameters:

v - The vertex

Returns:

A list of vertices adjacent to v

allAdjacentEdgesWithTriangulated

public java.util.List<Edge<V>> allAdjacentEdgesWithTriangulated(V v)

Finds all edges adjacent to the given vertex taking triangulated edges into account as well

Parameters:

v - The vertex

Returns:

A list of edges adjacent to v

edgeesBetweenWithTriangulated

public java.util.List<Edge<V>> edgeesBetweenWithTriangulated(V v1,
                                                             V v2)

Finds all edges between the given two vertices taking triangulated edges into account as well

Parameters:

v1 - The first vertex

v2 - The second vertex

Returns:

A list of edges between v1 and v2