graph.operations

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

java.lang.Object

graph.operations.GraphOperations<V,E>

Type Parameters:

V - The vertex type

E - The edge type

public class GraphOperations<V extends Vertex,E extends Edge<V>>
extends java.lang.Object

A class containing util methods, mostly regarding operations between two graphs

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
GraphOperations()

Method Summary

Modifier and Type	Method and Description
E	createNewEdge(V source, V destination, java.lang.Class<?> edgeClass) Creates a new edge connecting two provided vertices
java.util.List<E>	edgesInCommon(Graph<V,E> graph1, Graph<V,E> graph2) Finds edges which the given two graphs have in common
Graph<V,E>	formCycleGraph(java.util.List<V> vertices, java.lang.Class<?> edgeClass) Forms a cycle from vertices v1...vn in that order
boolean	isProperSubgraph(Graph<V,E> supergraph, Graph<V,E> subgraph) Determines is one graph is a proper subraph of another one H is a proper subgraph of G, if V(H)!=V(G) || E(H)!=E(G)
boolean	isSubgraph(Graph<V,E> supergraph, Graph<V,E> subgraph) Determines is one graph is a subgraph of another one
Graph<V,E>	removeEdgeFromGraph(Graph<V,E> graph, E edge) Removes an edge from the graph
Graph<V,E>	union(java.util.List<Graph<V,E>> graphs) Finds a graph which is a union of the provided list of graphs
java.util.List<V>	verticesInCommon(Graph<V,E> graph1, Graph<V,E> graph2) Finds vertices which the given two graphs have in common

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GraphOperations

public GraphOperations()

Method Detail

verticesInCommon

public java.util.List<V> verticesInCommon(Graph<V,E> graph1,
                                          Graph<V,E> graph2)

Finds vertices which the given two graphs have in common

Parameters:

graph1 - The first graph

graph2 - The second graph

Returns:

A list of vertices which graph1 and graph2 have in common

edgesInCommon

public java.util.List<E> edgesInCommon(Graph<V,E> graph1,
                                       Graph<V,E> graph2)

Finds edges which the given two graphs have in common

Parameters:

graph1 - The first graph

graph2 - The second graph

Returns:

A list of edges which graph1 and graph2 have in common

union

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

Finds a graph which is a union of the provided list of graphs

Parameters:

graphs - A list of graphs

Returns:

A graph which is a union of all graphs in list graphs

isSubgraph

public boolean isSubgraph(Graph<V,E> supergraph,
                          Graph<V,E> subgraph)

Determines is one graph is a subgraph of another one

Parameters:

supergraph - Potential supergraph

subgraph - Potential subgraph

Returns:

True if subgraph is a subgraph of supergraph false otherwise

isProperSubgraph

public boolean isProperSubgraph(Graph<V,E> supergraph,
                                Graph<V,E> subgraph)

Determines is one graph is a proper subraph of another one H is a proper subgraph of G, if V(H)!=V(G) || E(H)!=E(G)

Parameters:

supergraph - Potential supergraph

subgraph - Potential subgraph

Returns:

true if subgraph is a proper subgraph of supergraph false otherwise

removeEdgeFromGraph

public Graph<V,E> removeEdgeFromGraph(Graph<V,E> graph,
                                      E edge)

Removes an edge from the graph

Parameters:

graph - Graph

edge - Edge to be removed

Returns:

Graph constructed from the graph by removing edge edge

formCycleGraph

public Graph<V,E> formCycleGraph(java.util.List<V> vertices,
                                 java.lang.Class<?> edgeClass)

Forms a cycle from vertices v1...vn in that order

Parameters:

vertices - A list of vertices

edgeClass - Class of the edges of the graph

Returns:

A graph which a a cycle containing all vertices in list vertices

createNewEdge

public E createNewEdge(V source,
                       V destination,
                       java.lang.Class<?> edgeClass)

Creates a new edge connecting two provided vertices

Parameters:

source - Source vertex

destination - Destination vertex

edgeClass - Class of the edge

Returns:

Edge between source and destination