graph.tree.bc

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

java.lang.Object

graph.elements.Graph<BCTreeNode,BCTreeEdge>

graph.tree.bc.BCTree<V,E>

Type Parameters:

V - The vertex type

E - The edge type

public class BCTree<V extends Vertex,E extends Edge<V>>
extends Graph<BCTreeNode,BCTreeEdge>

Class represents a block-cut vertex tree and contains methods for its construction given a separable graph Let B be the set of blocks and C be the set of cut vertices of a separable graph G. Construct a graph H with vertex set B U C in which adjacencies are defined as follows: ci in C is adjacent to bj in B if and only if the block bj of G contains the cut vertex ci of G

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
BCTree(Graph<V,E> graph) Constructs the BC-tree of the specified graph

Method Summary

Modifier and Type	Method and Description
void	addVertex(BCTreeNode node) Add one vertex to the graph
java.util.List<BCTreeNode>	getbVertices()
java.util.List<BCTreeNode>	getcVertices()
java.util.List<Graph<V,E>>	getPendants()
BCTreeNode	getRoot()
void	removeVertex(BCTreeNode node) Removes a vertex from the graph, thus updating all relevant structures and also removing the edges it was a part of
void	setbVertices(java.util.List<BCTreeNode> bVertices)
void	setcVertices(java.util.List<BCTreeNode> cVertices)
void	setPendants(java.util.List<Graph<V,E>> pendants)
void	setRoot(BCTreeNode root)
void	updatePendants() Updates the list of pendants after certain tree nodes were added or removed, thus changing degrees of other nodes

Methods inherited from class graph.elements.Graph

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

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

BCTree

public BCTree(Graph<V,E> graph)

Constructs the BC-tree of the specified graph

Parameters:

graph - Graph

Method Detail

addVertex

public void addVertex(BCTreeNode node)

Description copied from class: Graph

Add one vertex to the graph

Overrides:

addVertex in class Graph<BCTreeNode,BCTreeEdge>

Parameters:

node - Vertex to add

removeVertex

public void removeVertex(BCTreeNode node)

Description copied from class: Graph

Removes a vertex from the graph, thus updating all relevant structures and also removing the edges it was a part of

Overrides:

removeVertex in class Graph<BCTreeNode,BCTreeEdge>

Parameters:

node - Vertex to remove

updatePendants

public void updatePendants()

Updates the list of pendants after certain tree nodes were added or removed, thus changing degrees of other nodes

getcVertices

public java.util.List<BCTreeNode> getcVertices()

Returns:

The cut vertices

setcVertices

public void setcVertices(java.util.List<BCTreeNode> cVertices)

Parameters:

cVertices - The cut vertices to set

getbVertices

public java.util.List<BCTreeNode> getbVertices()

Returns:

The block vertices

setbVertices

public void setbVertices(java.util.List<BCTreeNode> bVertices)

Parameters:

bVertices - The block vertices to set

getPendants

public java.util.List<Graph<V,E>> getPendants()

Returns:

the pendants

setPendants

public void setPendants(java.util.List<Graph<V,E>> pendants)

Parameters:

pendants - The pendants to set

getRoot

public BCTreeNode getRoot()

Returns:

The root

setRoot

public void setRoot(BCTreeNode root)

Parameters:

root - The root to set