Uses of Interface
edu.uci.ics.jung.graph.Graph

For each vertex pair v, v1 in G, checks whether v and v1 are fully equivalent: meaning that they connect to the exact same vertices.

Creates an instance based on the specified graph and mapping from vertices to vertex sets, and generates a set of partitions based on this mapping.

Extracts the weak components from a graph.

Constructs an unassembled graph containing the k-neighborhood around the root node(s).

Constructs an unassembled graph containing the k-neighborhood around the root node(s).

Creates a generator of row_count x col_count lattices with the specified parameters.

Returns a graph in which each pair of vertices is connected by an undirected edge with the probability specified by the constructor.

Constructs a new instance of the generator, whose output will be an undirected graph, and which will use the current time as a seed for the random number generation.

Creates an instance with the specified parameters, whose underlying lattice is (a) of size latticeSize x latticeSize, and (b) toroidal.

Creates an instance with the specified parameters.

Creates an instance for graph which initializes the vertex locations using initializer.

Creates an instance for graph which sets the size of the layout to size.

Constructor for a SpringLayout for a raw graph with associated dimension--the input knows how big the graph is.

Constructor for a SpringLayout for a raw graph with associated dimension--the input knows how big the graph is.

Return true iff this ordering is canonical and therefore we should build statistics for it.

Calculates betweenness scores based on the all-pairs weighted shortest paths in the graph.

Creates an instance for the specified graph and alpha (random jump probability) parameter.

Creates an instance of DijkstraShortestPath for the specified unweighted graph (that is, all weights 1) which caches results locally.

Creates an instance of DijkstraShortestPath for the specified unweighted graph (that is, all weights 1) which caches results locally.

Creates an instance of DijkstraShortestPath for the specified graph and the specified method of extracting weights from edges, which caches results locally if and only if cached is true.

Creates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.

Create a Forest from the supplied Graph and supplied Supplier, which is used to create a new, empty Forest.

Creates an instance which generates a minimum spanning tree assuming constant edge weights.

Creates a Graph which is an edge-folded version of h, where hyperedges are replaced by k-cliques in the output graph.

Creates a Graph which is a vertex-folded version of h, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.

Converts g into a unipartite graph whose vertex set is the vertices of g's partition p.

Transforms graph (which may be of any directionality) into a directed graph.

Transforms graph (which may be of any directionality) into an undirected graph.

Creates a Graph which is an edge-folded version of h, where hyperedges are replaced by k-cliques in the output graph.

Creates a Graph which is a vertex-folded version of h, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.

Converts g into a unipartite graph whose vertices are the vertices of g's partition p, and whose edges consist of collections of the intermediate vertices from other partitions.

An interface for a graph which consists of a collection of rooted directed acyclic graphs.

A subtype of Graph which is a (directed, rooted) tree.

An abstract class for graphs whose edges all have the same EdgeType.

An implementation of Tree that delegates to a specified instance of DirectedGraph.

An implementation of DirectedGraph suitable for sparse graphs.

An implementation of Graph that delegates its method calls to a constructor-specified Graph instance.

An implementation of Tree in which each vertex has ≤ k children.

An implementation of Graph that is suitable for sparse graphs, orders its vertex and edge collections according to either specified Comparator instances or the natural ordering of their elements, and permits directed, undirected, and parallel edges.

An implementation of Graph that is suitable for sparse graphs and permits directed, undirected, and parallel edges.

An implementation of UndirectedGraph that is suitable for sparse graphs.

Creates a new instance based on the provided delegate.

Creates an instance with the specified source graph and Type (vertex/edge addition/removal).

Creates a sample directed acyclic graph by generating several "layers", and connecting nodes (randomly) to nodes in earlier (but never later) layers.

Returns a bigger test graph with a clique, several components, and other parts.

Returns an unmodifiable Graph backed by the passed Graph.

Returns e's index in graph.

Resets the indices for this edge and its parallel edges.

Resets the indices for this edge and its parallel edges.

Returns an unmodifiable Graph backed by the passed Graph.

Save a graph to disk per the appropriate format

Saves the graph to the specified writer.

Saves the graph to the specified file.

Saves the graph to the specified file.

Generates a graph: in this case, reads it from the file "samples/datasetsgraph/simple.net"

Returns true if this vertex in this graph is included in the collections of elements to be rendered, and false otherwise.

maintains caches of vertices and edges that will be the subset of the delegate graph's elements that are contained in some Rectangle.

Resets the indices for this edge and its parallel edges.