Uses of Interface
org.mathIT.graphs.Vertible

Packages that use Vertible

Package	Description
org.mathIT.graphs	Provides classes representing mathematical graphs and its vertices.
org.mathIT.gui	This package provides classes to enable graphical user interfaces (GUI).

Uses of Vertible in org.mathIT.graphs

Classes in org.mathIT.graphs with type parameters of type Vertible

Modifier and Type	Class and Description
class	Edge<V extends Vertible<V>> Objects of this class represent edges of general graphs.
class	FibonacciHeap<V extends Vertible<V>> This class implements a Fibonacci heap data structure.
class	Graph<V extends Vertible<V>> This class represents a general graph without multiple edges as an array list of vertices and the corresponding adjacency matrix.
class	PriorityQueue<V extends Vertible<V>> This class represents a priority queue for an array list of vertices.
class	Vertex<V extends Vertible<V>> An instance of this class represents a vertex of a graph.
interface	Vertible<V extends Vertible<V>> This interface specifies classes representing a vertex of a graph.
class	WeightedGraph<V extends Vertible<V>> This class represents a weighted directed graph as an array list of vertices.

Classes in org.mathIT.graphs that implement Vertible

Modifier and Type	Class and Description
class	Actor This class represents actors as individual nodes of a social network.
class	SimpleVertex An instance of this class represents a vertex of a directed graph.
class	Vertex<V extends Vertible<V>> An instance of this class represents a vertex of a graph.

Fields in org.mathIT.graphs declared as Vertible

Modifier and Type	Field and Description
protected V[]	Vertex.adjacency Adjacency list of this vertex.
protected V	Edge.end The end vertex of this edge.
protected V	Edge.start The start vertex of this edge.
protected V[]	Graph.vertices Array of vertices forming this graph.

Methods in org.mathIT.graphs with type parameters of type Vertible

Modifier and Type	Method and Description
static <V extends Vertible<V>> FibonacciHeap<V>	FibonacciHeap.union(FibonacciHeap<V> h1, FibonacciHeap<V> h2) Joins two Fibonacci heaps into a new one.

Methods in org.mathIT.graphs that return Vertible

Modifier and Type	Method and Description
V[]	Vertex.getAdjacency() Returns the adjacency list of this vertex as specified by the weighted graph it belongs to.
V[]	Vertible.getAdjacency() Returns the adjacency list of this vertex as specified by the graph it belongs to.
V[]	Graph.getVertices() Returns an array containing all vertices of this graph.

Methods in org.mathIT.graphs with parameters of type Vertible

Modifier and Type	Method and Description
void	Vertex.setAdjacency(V[] adjacency) Sets the adjacency list of this vertex as specified by the weighted graph it belongs to.
void	Vertible.setAdjacency(V[] adjacency) Sets the adjacency list of this vertex as specified by the graph it belongs to.
void	Graph.setVertices(V[] vertices) Sets the vertices of this graph.
Graph<V>	Graph.subgraph(V[] vertices) Returns the subgraph given by the specified array of vertices of this graph.
String	Clustering.toString(Vertible[] vertices) Returns a string representing this clustering of vertices.

Constructors in org.mathIT.graphs with parameters of type Vertible

Constructor and Description
FibonacciHeap(V[] vertices) Constructs a FibonacciHeap object containing the elements of the specified array.
Graph(ArrayList<V> vertices, int[][] adjacency, V[] arrayTemplate) Creates a directed graph from the specified array list of vertices and the adjacency matrix.
Graph(ArrayList<V> vertices, V[] arrayTemplate) Creates a graph with the specified vertices.
Graph(boolean undirected, int[][] adjacency, V[] arrayTemplate) Creates a graph from the specified adjacency matrix.
Graph(boolean undirected, V[] vertices) Creates a graph with the specified vertices.
Graph(boolean undirected, V[] vertices, int[][] adjacency) Creates a graph from the specified array of vertices and the adjacency matrix.
Graph(int[][] adjacency, V[] arrayTemplate) Creates a directed graph from the specified adjacency matrix.
Graph(V[] vertices) Creates a directed graph with the specified vertices.
Graph(V[] vertices, int[][] adjacency) Creates a directed graph from the specified array of vertices and the adjacency matrix.
PriorityQueue(V[] vertices) Creates a priority queue containing the input vertices.
Vertex(int index, String name, V[] adjacency) Creates a vertex with the specified index and adjacency list, whose name equals the index.
Vertex(int index, V[] adjacency) Creates a vertex with the specified index and adjacency list, whose name equals the index.
WeightedGraph(ArrayList<V> vertices, double[][] weight, V[] arrayTemplate) Creates a directed graph from the specified array list of vertices and the weight matrix; the adjacency list of each vertex is derived from the weight matrix.
WeightedGraph(boolean undirected, V[] vertices, double[][] weight) Creates a graph from the specified array of vertices and the weight matrix.
WeightedGraph(boolean undirected, V[] vertices, int[][] adjacency) Creates a weighted graph from the specified array of vertices and the adjacency matrix, deriving a weight matrix where each edge has weight 1.
WeightedGraph(V[] vertices, double[][] weight) Creates a graph from the specified array of vertices and the weight matrix.
WeightedGraph(V[] vertices, int[][] adjacency) Creates a directed weighted graph from the specified array of vertices and the adjacency matrix, deriving a weight matrix where each edge has weight 1.

Uses of Vertible in org.mathIT.gui

Classes in org.mathIT.gui with type parameters of type Vertible

Modifier and Type	Class and Description
class	GraphCanvas<V extends Vertible<V>,E> This class enables to let plot and print a graph.
class	GraphViewer<V extends Vertible<V>,E> This class provides a visualization frame to show a specified graph.

Methods in org.mathIT.gui with type parameters of type Vertible

Modifier and Type	Method and Description
static <T extends Vertible<T>,K> void	GraphViewer.visualize(Graph<T> graph) This method visualizes a graph.