graph.properties

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

java.lang.Object

graph.properties.GraphProperties<V,E>

Type Parameters:

V - The vertex type

E - The edge type

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

A class containing methods for checking various properties of the given graph

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
GraphProperties(Graph<V,E> graph)

Method Summary

Modifier and Type	Method and Description
java.util.List<V>	getCutVertices() Finds all cut vertices of a graph
java.util.List<java.lang.Double>	getEigenValues() Finds the graph's eigen values
boolean	isBiconnected() Checks if the graph is biconnected
boolean	isConnected() Checks is graph is connected
boolean	isConnected(java.util.List<V> excluding) Checks is graph is connected
boolean	isCyclic() Checks if the graph is cyclic
boolean	isRing() Checks if the graph is a ring
boolean	isTree() Checks if the graph is a tree
java.util.List<Graph<V,E>>	listBiconnectedComponents() Finds all biconnected components of a graph
java.util.List<java.util.List<E>>	listMultiEdges() Finds all multiedges in a graph
java.util.List<V>	treeLeaves(V root) Lists all tree leaves (presumes that the graph is a tree)

Methods inherited from class java.lang.Object

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

Constructor Detail

GraphProperties

public GraphProperties(Graph<V,E> graph)

Method Detail

isConnected

public boolean isConnected()

Checks is graph is connected

Returns:

true if the graph is connected false otherwise

getCutVertices

public java.util.List<V> getCutVertices()

Finds all cut vertices of a graph

Returns:

A list containing all cut vertices

isBiconnected

public boolean isBiconnected()

Checks if the graph is biconnected

Returns:

true if graph is biconnected, @{code false} otherwise

getEigenValues

public java.util.List<java.lang.Double> getEigenValues()

Finds the graph's eigen values

Returns:

A list of the graph's eigen values

isConnected

public boolean isConnected(java.util.List<V> excluding)

Checks is graph is connected

Parameters:

excluding - A list of vertices such that the graph should stay connected even if they are removed

Returns:

true if graph is connected, false otherwise

isCyclic

public boolean isCyclic()

Checks if the graph is cyclic

Returns:

true if graph is cyclic, @{code false} otherwise

isTree

public boolean isTree()

Checks if the graph is a tree

Returns:

true if graph is a tree, @{code false} otherwise

treeLeaves

public java.util.List<V> treeLeaves(V root)

Lists all tree leaves (presumes that the graph is a tree)

Parameters:

root - The tree's root

Returns:

List of leaves

listMultiEdges

public java.util.List<java.util.List<E>> listMultiEdges()

Finds all multiedges in a graph

Returns:

A list containing list of edges between two vertices (in case when there is more than one edge between them)

listBiconnectedComponents

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

Finds all biconnected components of a graph

Returns:

A list of grap's biconnected components

isRing

public boolean isRing()

Checks if the graph is a ring

Returns:

true if graph is a ring, @{code false} otherwise