Grph

java.lang.Object
- grph.Grph

All Implemented Interfaces:

DirectedGraph, DirectedHyperGraph, DirectedSimpleGraph, EdgeSet, GrphPrimitives, UndirectedGraph, UndirectedHyperGraph, UndirectedSimpleGraph, UnqualifiedGraph, VertexSet, java.io.Serializable, java.lang.Cloneable

Direct Known Subclasses:

InMemoryGrph
```
public abstract class Grph
extends java.lang.Object
implements GrphPrimitives, java.lang.Cloneable, java.io.Serializable
```
A full-featured graph object, exhibiting all available operations and algorithms.

See Also:

Serialized Form

Nested Class Summary

Nested Classes
Modifier and Type	Class and Description
`static class`	`Grph.DIRECTION`
`static class`	`Grph.MaxIndependentSetAlgorithm` Implemented Maximum Independent Set algorithms.
`static class`	`Grph.MinVertexCoverAlgorithm` Implemented Minimum Vertex Cover algorithms.
`static class`	`Grph.TYPE`

Field Summary

Fields
Modifier and Type	Field and Description
`GrphAlgorithmCache<AdjacencyMatrix>`	`adjacencyMatrixAlgo`
`AllClusteringCoefficientsAlgorithm`	`allClusteringCoefficientsAlgorithm`
`GrphAlgorithm<java.lang.Double>`	`avgClusteringCoefficientAlgorithm`
`GrphAlgorithmCache<java.lang.Double>`	`avgDegreeAlgorithm`
`GrphAlgorithm<SearchResult[]>`	`bfsAlgorithm`
`GrphAlgorithmCache<GraphColoring>`	`bipartiteAlgorithm`
`GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet>`	`branchingMinimumVertexCoverAlgorithm`
`GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet>`	`bruteForceMinimumVertexCoverAlgorithm`
`GrphAlgorithm<java.lang.Integer>`	`centerAlgorithm`
`GrphAlgorithmCache<java.lang.Boolean>`	`chordalAlgo`
`static toools.io.file.Directory`	`COMPILATION_DIRECTORY`
`GrphAlgorithmCache<Grph>`	`complementAlgorithm`
`GrphAlgorithmCache<java.lang.Boolean>`	`completenessAlgorithm`
`GrphAlgorithmCache<java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>>`	`connectedComponentsAlg`
`GrphAlgorithmCache<java.lang.Boolean>`	`connectednessAlgorithm`
`GrphAlgorithmCache<java.lang.Double>`	`densityAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`diameterAlgorithm`
`GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet>`	`FominGrandoniKratschMaximumindependentSetAlgorithm`
`GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet>`	`girthAlgorithm`
`static java.util.Set<java.lang.String>`	`HOSTS`
`GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet>`	`inacessibleVertices`
`GrphAlgorithmCache<toools.math.IntMatrix>`	`incidenceMatrixAlgo`
`GrphAlgorithmCache<int[][]>`	`inNeighborsAlgorithm`
`GrphAlgorithmCache<int[][]>`	`inOutNeighborsAlgorithm`
`GrphAlgorithmCache<java.lang.Boolean>`	`irreflexiveAlgorithm`
`GrphAlgorithmCache<java.lang.Boolean>`	`isCyclicAlgorithm`
`GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet>`	`isolatedVerticesAlgorithm`
`GrphAlgorithmCache<Grph>`	`lineGraphAlg`
`static toools.log.Logger`	`logger`
`GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet>`	`LPMaximumindependentSetAlgorithm`
`GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet>`	`LPMaxMatchingAlgorithm`
`GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet>`	`LPMinVertexCoverAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`maxInEdgeDegreeAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`maxInVertexDegreeAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`maxOutEdgeDegreeAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`maxOutVertexDegreeAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`minInEdgeDegreeAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`minInVertexDegreeAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`minOutEdgeDegreeAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`minOutVertexDegreeAlgorithm`
`GrphAlgorithmCache<MultigraphnessResult>`	`multigraphnessAlgorithm`
`GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet>`	`NiedermeierMinimumVertexCoverAlgorithm`
`GrphAlgorithmCache<int[][]>`	`outNeighborsAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`radiusAlgorithm`
`GrphAlgorithmCache<java.lang.Boolean>`	`reflexivityAlgorithm`
`GrphAlgorithmCache<java.lang.Boolean>`	`regularityAlgorithm`
`GrphAlgorithmCache<java.lang.Boolean>`	`simplenessAlgorithm`
`GrphAlgorithm<java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>>`	`tarjanSCC`
`GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntArrayList>`	`topologicalSortingAlg`
`GrphAlgorithmCache<java.lang.Boolean>`	`treenessAlgorithm`
`GrphAlgorithmCache<Result>`	`trianglesAlgorithm`
`GrphAlgorithmCache<java.lang.Integer>`	`twoSweepDiameterAlg`
`GrphAlgorithm<DistanceMatrix>`	`unweightedDistanceMatrixAlgorithm`
`GrphAlgorithm<PredecessorMatrix>`	`unweightedPredecessorMatrixAlgorithm`
`static boolean`	`useCache`
`GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet[]>`	`vertexAdjacenciesAsIDSetsAlgorithm`
`GrphAlgorithmCache<int[]>`	`vertexListAlgorithm`

Constructor Summary

Constructors
Constructor and Description

Grph(java.lang.String name, int nbVertices, int nbEdges)

Constructors
Constructor and Description
`Grph(java.lang.String name, int nbVertices, int nbEdges)`

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`int`	`addDirectedSimpleEdge(int tail, int head)` Adds an arc connecting the given source and destination vertices.
`it.unimi.dsi.fastutil.ints.Int2IntMap`	`addGraph(Grph otherGraph)`
`void`	`addHyperEdge(int edge, int... vertices)`
`it.unimi.dsi.fastutil.ints.IntSet`	`addNVertices(int n)` Creates n vertices in this graph.
`int`	`addSimpleEdge(int src, int dest, boolean directed)` Connects the given vertices with a simple edge created on-the-fly.
`void`	`addSimpleEdge(int src, int edge, int dest, boolean directed)` Connects the given vertices with the given simple edge.
`int`	`addUndirectedSimpleEdge(int v1, int v2)` Adds an edge connecting the two given vertices.
`int`	`addVertex()` Creates a new vertex in the graph.
`void`	`addVertices(it.unimi.dsi.fastutil.ints.IntSet s)`
`boolean`	`areEdgesAdjacent(int a, int b)`
`boolean`	`areVerticesAdjacent(int src, int dest)` Checks if the given two vertices are connected.
`SearchResult`	`bfs(int source)` Performs a BFS from the given vertex.
`SearchResult[]`	`bfs(toools.collections.primitive.LucIntSet sources)`
`it.unimi.dsi.fastutil.ints.IntArrayList`	`bfsList(int sourceVertex)`
`void`	`chain(boolean directed)` Connect the vertices in this graph as chain.
`void`	`clear()` Clears this graph.
`void`	`clearCache()` Clears the cache for all algorithms that employs one.
`void`	`clique()` Connect all vertices in this graph as a clique.
`void`	`clique(it.unimi.dsi.fastutil.ints.IntSet s)` Connect the given set of vertices as a clique.
`Grph`	`clone()` Computes a clone of this graph.
`MaxFlowAlgorithmResult`	`computeMaxFlow(int s, int t, NumericalProperty weights)` Computes the maximum flow from the given source to the given destination.
`void`	`connectToKClosestNeighbors(int k)` Connect each vertex to its k-closest neighbours, according to the current topology.
`boolean`	`contains(Grph g)` Checks if this graph contains the given graph.
`boolean`	`containsAPath(int source, int destination)`
`void`	`contractEdge(int e)`
`void`	`contractVertices(int a, int b)`
`void`	`contractVertices(int a, int b, boolean allowMultipleEdges)`
`javax.swing.JComponent`	`createSwingRenderer()`
`void`	`dgrid(int width, int height)` Connect vertices currently in the graph as a DIRECTED grid of dimension (w, h).
`void`	`disconnect(int src, int destination)` Disconnect the two given vertices.
`void`	`disconnectVertex(int v)` Disconnect the given vertex, i.e.
`void`	`display()` Display this graph in a graphical frame, using automatic layout.
`org.miv.graphstream.ui.GraphViewerRemote`	`displayGraphstream_0_4_2()` Display this graph in a graphical frame, using GraphStream 0.4.2.
`void`	`displayImg()`
`void`	`displayReport()`
`void`	`displaySVGSalamander()`
`void`	`dring()` Creates a directed ring consisting of the vertices already in the graph.
`void`	`ensureNVertices(int n)` Ensure this graph has at least the specified amount of vertices.
`boolean`	`equals(Grph g)` Checks if this graph equals the given graph.
`boolean`	`equals(java.lang.Object o)` Checks if this graph contains the given graph.
`GrphAlgorithm`	`findAlgorithm(java.lang.String name)`
`Property`	`findPropertyByName(java.lang.String name)`
`static Grph`	`fromCaidaMap(toools.io.file.RegularFile f)` Builds a new graph from the given CAIDA map.
`static Grph`	`fromGraphML(java.lang.String graphMLText)`
`static Grph`	`fromGraphML(java.lang.String graphMLText, java.lang.Class vPropertyClass, java.lang.Class ePropertyClass)`
`static Grph`	`fromGrphBinary(byte[] text)`
`static Grph`	`fromGrphText(java.lang.String text)`
`static Grph`	`fromGrphTextFile(java.lang.String filename)`
`AdjacencyMatrix`	`getAdjacencyMatrix()` Computes a adjacency matrix for this graph.
`java.util.Set<Path>`	`getAllCycles()`
`it.unimi.dsi.fastutil.ints.IntArrayList`	`getAllInEdgeDegrees()`
`it.unimi.dsi.fastutil.ints.IntArrayList`	`getAllOutEdgeDegrees()`
`java.util.Collection<Path>`	`getAllPaths()`
`double`	`getAverageClusteringCoefficient()` Computes the average clustering coefficient of this graph.
`double`	`getAverageDegree()` Computes the average degree of this graph.
`double`	`getAverageDegree(Grph.TYPE type, Grph.DIRECTION direction)` Computes the average degree of this graph.
`Grph`	`getBipartiteSubgraphInducedByVertices(it.unimi.dsi.fastutil.ints.IntSet A, it.unimi.dsi.fastutil.ints.IntSet B)`
`int`	`getCenter()` Retrieves the vertex at the center of the graph.
`void`	`getCircleStar()`
`java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>`	`getCliques()`
`double`	`getClusteringCoefficient()`
`double`	`getClusteringCoefficient(int v)`
`toools.math.Distribution<java.lang.Double>`	`getClusteringCoefficientDistribution()`
`Grph`	`getComplement()` Computes the complement graph for this graph.
`it.unimi.dsi.fastutil.ints.IntSet`	`getConnectedComponentContaining(int vertex, Grph.DIRECTION direction)` Computes the connected component containing the given vertex, according to the given search direction.
`java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>`	`getConnectedComponents()` Computes the set of connected component on this graph.
`it.unimi.dsi.fastutil.ints.IntSet`	`getCutEdges(it.unimi.dsi.fastutil.ints.IntSet a, it.unimi.dsi.fastutil.ints.IntSet b)` Computes the edges describing the cut formed by the two given sets.
`int`	`getCutSize(it.unimi.dsi.fastutil.ints.IntSet a, it.unimi.dsi.fastutil.ints.IntSet b)` Compute the size of the cut.
`static int`	`getDefaultNumberOfThreads()`
`toools.math.Distribution<java.lang.Integer>`	`getDegreeDistribution(Grph.TYPE type, Grph.DIRECTION dir)` Computes a degree distribution for this graph
`double`	`getDensity()` Computes the exact density of this graph.
`java.lang.String`	`getDescription()` Computes a textual description for this graph.
`int`	`getDiameter()` Computes the exact diameter of this graph.
`java.lang.String`	`getDifference(Grph g)` Compares this graph and the given graph and returns the first difference found.
`DistanceMatrix`	`getDistanceMatrix(NumericalProperty edgeWeights)` Computes a distance matrix for this graph.
`int`	`getEccentricity(int v)`
`int`	`getEccentricity(int v, NumericalProperty weights)` Computes the eccentricity of the given vertex.
`NumericalProperty`	`getEdgeColorProperty()`
`int`	`getEdgeDegree(int v)`
`Property`	`getEdgeLabelProperty()`
`grph.Grph.EDGE_NATURE`	`getEdgeNature(int e)` Gets the nature of the given edge (undirected simple edge, directed simple edge, undirected hyper-edge or directed-hyperedge).
`java.util.Collection<VertexPair>`	`getEdgePairs()`
`it.unimi.dsi.fastutil.ints.IntSet`	`getEdgesAdjacentToEdge(int e)` Computes the set of edges incident to vertices incident to the given edge.
`it.unimi.dsi.fastutil.ints.IntSet`	`getEdgesConnecting(int src, int dest)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getEdgesIncidentTo(int v)` Computes the set of edges incident to the given vertex.
`NumericalProperty`	`getEdgeStyleProperty()`
`NumericalProperty`	`getEdgeWidthProperty()`
`int`	`getFartestVertex(int v)`
`int`	`getFartestVertex(int v, NumericalProperty edgeWeights)`
`java.util.List<it.unimi.dsi.fastutil.ints.IntSet>`	`getFringes(int numberOfHops, int root)`
`int`	`getGirth()` The girth of a graph is defined as the length of a shortest cycle, or infinite if the graph is acyclic.
`java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>`	`getGpmetisPartitionning(int numberOfPartitions, Gpmetis.Ptype ptype, Gpmetis.Ctype ctype, Gpmetis.Iptype iptype, Gpmetis.Objtype objtype, boolean contig, boolean minconn, int ufactor, int niter, int ncuts, java.util.Random r)`
`java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>`	`getGpmetisPartitionning(int numberOfPartitions, java.util.Random r)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getInaccessibleVertices()` Returns a set of vertices that are inaccessible (e.g.
`toools.math.IntMatrix`	`getIncidenceMatrix()` Computes a incidence matrix for this graph.
`java.util.List<Matching>`	`getInducedSubgraphIsomorphism(Grph pattern, boolean findAllSolutions)` Returns if the given "pattern graph" is isomorphic to a subgraph in this graph.
`int`	`getInEdgeDegree(int v)`
`toools.collections.primitive.LucIntSet`	`getInEdges(int v)` Computes the set of out-edges for the given vertex.
`protected it.unimi.dsi.fastutil.ints.IntSet`	`getInElements(int v)`
`int[][]`	`getInNeighborhoods()`
`toools.collections.primitive.LucIntSet`	`getInNeighbors(int v)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getInNeighbours(int v)`
`toools.collections.primitive.LucIntSet`	`getInOnlyEdges(int v)`
`toools.collections.primitive.LucIntSet`	`getInOutOnlyEdges(int v)`
`int`	`getInVertexDegree(int v)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getIsolatedVertices()` Computes the set of isolated vertices in this graph.
`it.unimi.dsi.fastutil.ints.IntSet`	`getKClosestNeighbors(int vertex, int k, NumericalProperty edgeWeights)`
`java.util.List<ArrayListPath>`	`getKShortestPaths(int s, int t, int k, NumericalProperty edgeWeights)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getLargestConnectedComponent()` Determines the largest connected component in the graph.
`Grph`	`getLineGraph()` Computes the line graph of this graph.
`Grph`	`getLineGraph(int n)` Computes n iterations of the "line graph" operation on this graph.
`double[]`	`getLocalClusteringCoefficients()`
`it.unimi.dsi.fastutil.ints.IntSet`	`getLoops(int v)` Computes the set of self-loops incident to the given vertex
`it.unimi.dsi.fastutil.ints.IntSet`	`getMaximumClique()` Computes the maximum clique in this graph, using an ant-based algorithm defined by Chistine Solnon.
`it.unimi.dsi.fastutil.ints.IntSet`	`getMaximumIndependentSet()` Computes a independent set of maximum cardinality, based on
`it.unimi.dsi.fastutil.ints.IntSet`	`getMaximumIndependentSet(Grph.MaxIndependentSetAlgorithm algorithm)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getMaximumMatching()` Computes a maximum (cardinality) matching.
`int`	`getMaxInEdgeDegrees()`
`int`	`getMaxInVertexDegrees()`
`int`	`getMaxOutEdgeDegrees()`
`int`	`getMaxOutVertexDegrees()`
`it.unimi.dsi.fastutil.ints.IntSet`	`getMinimumVertexCover()` Computes a vertex cover of minimum cardinality.
`it.unimi.dsi.fastutil.ints.IntSet`	`getMinimumVertexCover(Grph.MinVertexCoverAlgorithm algorithm)` Computes a minimum vertex cover by applying the specified algorithm.
`int`	`getMinInEdgeDegrees()`
`int`	`getMinInVertexDegrees()`
`int`	`getMinOutEdgeDegrees()`
`int`	`getMinOutVertexDegrees()`
`int[][]`	`getNeighborhoods()`
`int[][]`	`getNeighbors(Grph.DIRECTION direction)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getNeighborsAtMaxDistance(int vertex, int maxDistance, NumericalProperty p)`
`toools.collections.primitive.LucIntSet`	`getNeighbours(int v)` Computes the set of neighbors of the given vertex, cumulating in and out neighbors.
`toools.collections.primitive.LucIntSet`	`getNeighbours(int vertex, Grph.DIRECTION direction)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getNeighbours(it.unimi.dsi.fastutil.ints.IntSet s)` Computes the (open) neighborhood of the set s of vertices (that is the set of vertices that have at least one neighbour in s, and do not belong to s)
`it.unimi.dsi.fastutil.ints.IntSet`	`getNeighboursAtMostKHops(int k, int v)`
`int`	`getNumberOfDirectedEdges()`
`int`	`getNumberOfEdges()`
`int`	`getNumberOfHyperEdges()`
`int`	`getNumberOfSimpleEdges()`
`int`	`getNumberOfTriangles()` Computes the number of triangles in the graph.
`int`	`getNumberOfUndirectedEdges()`
`int`	`getNumberOfVertices()` Computes the number of vertices in this graph.
`toools.collections.primitive.LucIntSet`	`getOppositeEdges(int e)`
`int`	`getOrder()` Computes the order of this graph.
`int`	`getOutEdgeDegree(int v)`
`toools.collections.primitive.LucIntSet`	`getOutEdges(int v)` Computes the set of out-edges for the given vertex.
`int[][]`	`getOutNeighborhoods()` Computes the vertex adjacency of the graph in the form of a two-dimension int array.
`toools.collections.primitive.LucIntSet`	`getOutNeighbors(int v)` Computes the set of out-neighbors of the given vertex.
`toools.collections.primitive.LucIntSet`	`getOutOnlyEdges(int v)`
`int`	`getOutVertexDegree(int v)`
`PageRank`	`getPageRanking(java.util.Random r)`
`java.util.Collection<Matching>`	`getPartialSubgraphIsomorphism(Grph pattern, boolean findAllSolutions)` Returns if the given "pattern graph" is partially isomorphic to a subgraph in this graph.
`java.util.Collection<Property>`	`getProperties()` Computes the set of properties applicable to this graph.
`int`	`getRadius()` Computes the exact radius of this graph.
`it.unimi.dsi.fastutil.ints.IntSet`	`getShortestCycle()`
`Path`	`getShortestPath(int source, int destination)`
`SearchResultWrappedPath`	`getShortestPath(int source, int destination, NumericalProperty edgeWeights)` Computes a shortest path from the given source to the given destination.
`it.unimi.dsi.fastutil.ints.IntSet`	`getSimplicialVertices()` Comptes the set of simplitial vertices in this graph.
`it.unimi.dsi.fastutil.ints.IntSet`	`getSinks()` Computes the set of sink vertices in this graph.
`int`	`getSize()`
`int`	`getSomeEdgeConnecting(int src, int dest)` Returns an (hyper)edge or arc that connects src and dest
`it.unimi.dsi.fastutil.ints.IntSet`	`getSources()` Computes the set of source vertices in this graph.
`Grph`	`getSpanningTree()`
`java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>`	`getStronglyConnectedComponents()` Tarjan's algorithm.
`Grph`	`getSubgraphInducedByEdges(it.unimi.dsi.fastutil.ints.IntSet edges)` Computes the subgraph induced by the given set of edges.
`Grph`	`getSubgraphInducedByVertices(it.unimi.dsi.fastutil.ints.IntSet vertices)` Computes the subgraph induced by the given set of vertices.
`java.util.List<TopologyListener>`	`getTopologyListeners()` Obtains the list of topology listeners for this graph.
`int`	`getTwoSweepBFSDiameterApproximatedDiameter()` Computues a two-sweeps approximation of the diameter of this graph.
`static toools.Version`	`getVersion()` Computes the version of the Grph library installed.
`NumericalProperty`	`getVertexColorProperty()`
`int`	`getVertexDegree(int v)`
`int`	`getVertexDegree(int v, Grph.TYPE type, Grph.DIRECTION dir)` Computes different types of degrees of the given vertex.
`Property`	`getVertexLabelProperty()`
`NumericalProperty`	`getVertexShapeProperty()`
`NumericalProperty`	`getVertexSizeProperty()`
`it.unimi.dsi.fastutil.ints.IntSet`	`getVerticesAccessibleThrough(int vertex, int e)`
`it.unimi.dsi.fastutil.ints.IntSet`	`getVerticesAccessibleThrough(int sourceVertex, it.unimi.dsi.fastutil.ints.IntSet links)`
`toools.collections.primitive.LucIntSet`	`getVerticesIncidentToEdge(int e)` Computes the set of vertices incident to the given edge.
`it.unimi.dsi.fastutil.ints.IntSet`	`getVerticesOfDegree(int degree)` Returns the subset of vertices that have a degree equal to `degree`.
`it.unimi.dsi.fastutil.ints.IntSet`	`getVerticesOfDegree(int degree, Grph.DIRECTION dir)` Returns the subset of vertices that have a in-degree or out-degree equal to `degree`, depending on the `dir` parameter's value.
`it.unimi.dsi.fastutil.ints.IntSet`	`getVerticesOfDegreeAtLeast(int minDegree)` Returns the subset of vertices that have a degree at least `degree`.
`void`	`glp()` Computes a GLP topology from the vertices in the graph.
`void`	`grid(int width, int height)` Connect vertices currently in the graph as a grid of dimension (w, h).
`void`	`grid(int width, int height, boolean directed, boolean createDiagonal, boolean secondaryDiagonal)` Connect vertices currently in the graph as a grid of dimension (w, h).
`boolean`	`hasCycles(int src)` Checks if this graph has a cycle, by initiating the search from the given source.
`boolean`	`hasLoop(int v)` Checks if the given vertex has self-loops on it.
`boolean`	`hasLoops()`
`boolean`	`hasMultipleEdges()` Checks if this graph is has multiple edges in it.
`void`	`highlight(java.util.Collection<Cluster> clusters)`
`void`	`highlight(java.util.Collection<Cluster> clusters, boolean highlightClusterHeads)`
`void`	`highlight(Grph subgraph)` Assigns the given color to all vertices and edges in the given graph.
`void`	`highlight(Grph subgraph, int color)`
`void`	`highlightEdges(it.unimi.dsi.fastutil.ints.IntSet edges)`
`void`	`highlightEdges(it.unimi.dsi.fastutil.ints.IntSet edges, int color)` Assigns the given color to all edges in the given set.
`void`	`highlightVertex(int v, int color)`
`void`	`highlightVertices(java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet> sets)`
`void`	`highlightVertices(int... vertices)`
`void`	`highlightVertices(it.unimi.dsi.fastutil.ints.IntSet vertices)` Assign adequate color to the given vertices so that they distinguish clearly on graphical views of this graph.
`void`	`highlightVertices(it.unimi.dsi.fastutil.ints.IntSet vertices, int color)` Assigns the given color to all vertices in the given set.
`boolean`	`isAntigraph()` Checks whether this graph is an antigraph.
`boolean`	`isBipartite()` Checks if this graph is bipartite.
`boolean`	`isChordal()` Checks if this graph is chordal or not.
`boolean`	`isClique(it.unimi.dsi.fastutil.ints.IntSet s)` Checks if the given set of vertices describes a clique in this graph.
`boolean`	`isComplete()` Checks if this graph is a complete graph.
`boolean`	`isConnected()` Checks if this graph is made of one single partition
`boolean`	`isCut(it.unimi.dsi.fastutil.ints.IntSet... setsOfVertices)` Computes if the given sets form a cut of this graph.
`boolean`	`isCut(it.unimi.dsi.fastutil.ints.IntSet a, it.unimi.dsi.fastutil.ints.IntSet b)` Computes if the two given sets form a cut of this graph.
`boolean`	`isCyclic()` Checks whether this graph is cyclic or not (o circuit in the case of digraphs).
`boolean`	`isDirected()` Checks if this graph is directed or not (i.e.
`boolean`	`isDirectedSimpleEdge(int u, int v)`
`boolean`	`isDirectedSimpleGraph()` Checks if this graph has only directed simple edges.
`boolean`	`isDominatingSet(it.unimi.dsi.fastutil.ints.IntSet s)` Tests if the given set in a dominating set of this graph.
`boolean`	`isHyperEdge(int e)`
`boolean`	`isHypergraph()` Checks if this graph is an hypergraph or not (i.e.
`boolean`	`isIndependentSet(it.unimi.dsi.fastutil.ints.IntSet s)` Tests if the given set is an independent set (a.k.a.
`boolean`	`isIrreflexive()` Checks if this graph is an irreflexive graph
`boolean`	`isIsomorphicTo(Grph anotherGraph)` Returns true if this graph is isomorphic to the given graph, false otherwise.
`boolean`	`isLeaf(int v)` Checks if the given vertex is a leaf.
`boolean`	`isLoop(int edge)` Checks whether the given edge is a self-loop or not.
`boolean`	`isMatching(it.unimi.dsi.fastutil.ints.IntSet s)` Computes if the given set of edges forms a matching of this graph.
`boolean`	`isMixed()` Checks if this graph is mixed or not (i.e.
`boolean`	`isNull()` Checks if this graph is a null graph.
`boolean`	`isReflexive()` Checks if this graph is a reflexive graph.
`boolean`	`isRegular()` Checks if this graph is a regular graph.
`boolean`	`isSimple()` Checks if this graph is a simple graph
`boolean`	`isSimpleEdge(int edge)` Checks if the given edge is a simple edge.
`boolean`	`isSimplicial(int v)` Checks if the given vertex is a simplicial one.
`boolean`	`isSink(int v)` Checks if the given vertex is a sink.
`boolean`	`isSource(int v)` Checks if the given vertex is a source.
`boolean`	`isStronglyConnected()`
`boolean`	`isTree()` Checks if this graph is a tree.
`boolean`	`isTrivial()` Checks if this graph is a trivial graph.
`boolean`	`isUndirectedSimpleEdge(int u, int v)`
`boolean`	`isUndirectedSimpleGraph()` Checks if this graph has only undirected simple edges.
`boolean`	`isVertexCover(it.unimi.dsi.fastutil.ints.IntSet s)` Tests if the given set in a vertex cover of this graph.
`java.util.Collection<GrphAlgorithmCache>`	`listCachingGraphAlgorithms()` Lists all graph algorithms that employ a cache.
`static Grph`	`loadOnlineGrph(java.lang.String url)` Loads the graph from the given URL.
`static void`	`main(java.lang.String[] args)`
`void`	`merge(Grph otherGraph)`
`void`	`performRandomTopologicalChange(java.util.Random r)` Performs a random change in this graph.
`java.lang.String`	`postOnTheWeb()` Post this graph this Grph website.
`it.unimi.dsi.fastutil.ints.IntSet`	`prune(boolean recursive)` Prunes this graph (remove leaves)
`void`	`removeEdges(it.unimi.dsi.fastutil.ints.IntSet edges)` Removes the given vertices from the graph.
`void`	`removeVertices(int... vertices)` Removes the given vertices from the graph.
`it.unimi.dsi.fastutil.ints.IntSet`	`removeVertices(java.util.function.IntPredicate filter, boolean recursive)` Removes all vertices matching the given filter.
`void`	`removeVertices(it.unimi.dsi.fastutil.ints.IntSet s)` Deletes the given vertices from the graph.
`toools.io.file.RegularFile`	`report()` Computes a report for this graph.
`void`	`revertEdge(int e)`
`void`	`ring()` Creates an undirected ring consisting of the vertices already in the graph.
`void`	`ring(boolean directed)`
`void`	`ring(it.unimi.dsi.fastutil.ints.IntSet vertices, boolean directed)`
`void`	`rnws(int k, double p)` Connects the vertices in the graph according to the Random-Newman-Watts-Strogatz topology generation scheme.
`void`	`rnws(int numberOfVertices, int k, double p)`
`SearchResult`	`search(int v, NumericalProperty edgeWeights)`
`void`	`setEdgesColor(NumericalProperty edgesColor)`
`void`	`setEdgesLabel(Property edgesLabel)`
`void`	`setEdgesStyle(NumericalProperty edgesStyle)`
`void`	`setEdgesWidth(NumericalProperty edgesWidth)`
`void`	`setVerticesColor(NumericalProperty verticesColor)`
`void`	`setVerticesLabel(Property verticesLabel)`
`void`	`setVerticesShape(NumericalProperty verticesShape)`
`void`	`setVerticesSize(NumericalProperty verticesSize)`
`it.unimi.dsi.fastutil.ints.IntArrayList`	`sortTopologically()` Topological sort of the vertices in this graph.
`int[]`	`sortVerticesByDegree()` Sort all vertices by degree.
`AbstractStepper`	`stepMonitor()`
`java.lang.String`	`toDot()` Computes a GraphViz expression of this graph.
`java.lang.String`	`toEdgeList()`
`java.lang.String`	`toGraphML()` Computes a GraphML (XML) expression of this graph.
`GraphstreamBasedRenderer`	`toGraphStream_0_4_2_AWTComponent()`
`toools.io.file.RegularFile`	`toGraphviz(GraphvizImageWriter.COMMAND cmd, GraphvizImageWriter.OUTPUT_FORMAT outputFormat)`
`toools.io.file.RegularFile`	`toGraphviz(GraphvizImageWriter.COMMAND cmd, GraphvizImageWriter.OUTPUT_FORMAT outputFormat, toools.io.file.Directory destination)` Computes a graphic file containing a representation of this graph generated by GraphViz.
`byte[]`	`toGrphBinary()` Computes a native-Grph binary expression of this graph.
`java.lang.String`	`toGrphText()` Computes a native-Grph textual expression of this graph.
`java.lang.String`	`toString_elements()`
`java.lang.String`	`toString()`
`java.lang.String`	`toTextADJ()`
`Grph`	`toUndirectedGraph()`
`void`	`undirectionalizeEdge(int e)`

Methods inherited from class java.lang.Object
finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface grph.UndirectedSimpleGraph
addUndirectedSimpleEdge, getNumberOfUndirectedSimpleEdges, getOneVertex, getTheOtherVertex, isUndirectedSimpleEdge

Methods inherited from interface grph.DirectedSimpleGraph
addDirectedSimpleEdge, getDirectedSimpleEdgeHead, getDirectedSimpleEdgeTail, getNumberOfDirectedSimpleEdges, isDirectedSimpleEdge

Methods inherited from interface grph.UndirectedHyperGraph
addToUndirectedHyperEdge, addUndirectedHyperEdge, getNumberOfUndirectedHyperEdges, getUndirectedHyperEdgeVertices, isUndirectedHyperEdge, removeFromHyperEdge

Methods inherited from interface grph.DirectedHyperGraph
addDirectedHyperEdge, addToDirectedHyperEdgeHead, addToDirectedHyperEdgeTail, getDirectedHyperEdgeHead, getDirectedHyperEdgeTail, getNumberOfDirectedHyperEdges, isDirectedHyperEdge, removeFromDirectedHyperEdgeHead, removeFromDirectedHyperEdgeTail

Methods inherited from interface grph.DirectedGraph
getInOnlyElements, getInOutOnlyElements, getNavigation, getOutOnlyElements

Methods inherited from interface grph.UnqualifiedGraph
removeEdge

Methods inherited from interface grph.VertexSet
addVertex, containsVertex, getNextVertexAvailable, getVertices, removeVertex

Methods inherited from interface grph.EdgeSet
containsEdge, getEdges, getNextEdgeAvailable, removeEdge, storeEdges

Field Detail

COMPILATION_DIRECTORY

public static toools.io.file.Directory COMPILATION_DIRECTORY

logger
```
public static toools.log.Logger logger
```

useCache
```
public static boolean useCache
```

HOSTS

public static final java.util.Set<java.lang.String> HOSTS

centerAlgorithm

public final transient GrphAlgorithm<java.lang.Integer> centerAlgorithm

allClusteringCoefficientsAlgorithm

public final transient AllClusteringCoefficientsAlgorithm allClusteringCoefficientsAlgorithm

avgClusteringCoefficientAlgorithm

public final transient GrphAlgorithm<java.lang.Double> avgClusteringCoefficientAlgorithm

unweightedDistanceMatrixAlgorithm

public final transient GrphAlgorithm<DistanceMatrix> unweightedDistanceMatrixAlgorithm

unweightedPredecessorMatrixAlgorithm

public final transient GrphAlgorithm<PredecessorMatrix> unweightedPredecessorMatrixAlgorithm

densityAlgorithm

public final transient GrphAlgorithmCache<java.lang.Double> densityAlgorithm

avgDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Double> avgDegreeAlgorithm

diameterAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> diameterAlgorithm

bfsAlgorithm

public final transient GrphAlgorithm<SearchResult[]> bfsAlgorithm

radiusAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> radiusAlgorithm

maxInEdgeDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> maxInEdgeDegreeAlgorithm

maxInVertexDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> maxInVertexDegreeAlgorithm

maxOutEdgeDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> maxOutEdgeDegreeAlgorithm

maxOutVertexDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> maxOutVertexDegreeAlgorithm

minInEdgeDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> minInEdgeDegreeAlgorithm

minInVertexDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> minInVertexDegreeAlgorithm

minOutEdgeDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> minOutEdgeDegreeAlgorithm

minOutVertexDegreeAlgorithm

public final transient GrphAlgorithmCache<java.lang.Integer> minOutVertexDegreeAlgorithm

completenessAlgorithm

public final transient GrphAlgorithmCache<java.lang.Boolean> completenessAlgorithm

connectednessAlgorithm

public final transient GrphAlgorithmCache<java.lang.Boolean> connectednessAlgorithm

multigraphnessAlgorithm

public final transient GrphAlgorithmCache<MultigraphnessResult> multigraphnessAlgorithm

reflexivityAlgorithm

public final transient GrphAlgorithmCache<java.lang.Boolean> reflexivityAlgorithm

regularityAlgorithm

public final transient GrphAlgorithmCache<java.lang.Boolean> regularityAlgorithm

simplenessAlgorithm

public final transient GrphAlgorithmCache<java.lang.Boolean> simplenessAlgorithm

treenessAlgorithm

public final transient GrphAlgorithmCache<java.lang.Boolean> treenessAlgorithm

vertexListAlgorithm

public final transient GrphAlgorithmCache<int[]> vertexListAlgorithm

complementAlgorithm

public final transient GrphAlgorithmCache<Grph> complementAlgorithm

outNeighborsAlgorithm

public final transient GrphAlgorithmCache<int[][]> outNeighborsAlgorithm

inNeighborsAlgorithm

public final transient GrphAlgorithmCache<int[][]> inNeighborsAlgorithm

inOutNeighborsAlgorithm

public final transient GrphAlgorithmCache<int[][]> inOutNeighborsAlgorithm

vertexAdjacenciesAsIDSetsAlgorithm

public final transient GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet[]> vertexAdjacenciesAsIDSetsAlgorithm

lineGraphAlg

public final transient GrphAlgorithmCache<Grph> lineGraphAlg

trianglesAlgorithm

public final transient GrphAlgorithmCache<Result> trianglesAlgorithm

isolatedVerticesAlgorithm

public final transient GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet> isolatedVerticesAlgorithm

adjacencyMatrixAlgo

public final transient GrphAlgorithmCache<AdjacencyMatrix> adjacencyMatrixAlgo

incidenceMatrixAlgo

public final transient GrphAlgorithmCache<toools.math.IntMatrix> incidenceMatrixAlgo

inacessibleVertices

public final transient GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet> inacessibleVertices

connectedComponentsAlg

public final transient GrphAlgorithmCache<java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>> connectedComponentsAlg

irreflexiveAlgorithm

public final transient GrphAlgorithmCache<java.lang.Boolean> irreflexiveAlgorithm

topologicalSortingAlg

public final transient GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntArrayList> topologicalSortingAlg

isCyclicAlgorithm

public final transient GrphAlgorithmCache<java.lang.Boolean> isCyclicAlgorithm

girthAlgorithm

public final transient GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet> girthAlgorithm

twoSweepDiameterAlg

public final transient GrphAlgorithmCache<java.lang.Integer> twoSweepDiameterAlg

bipartiteAlgorithm

public final transient GrphAlgorithmCache<GraphColoring> bipartiteAlgorithm

LPMaxMatchingAlgorithm

public final transient GrphAlgorithmCache<it.unimi.dsi.fastutil.ints.IntSet> LPMaxMatchingAlgorithm

LPMinVertexCoverAlgorithm

public final transient GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet> LPMinVertexCoverAlgorithm

bruteForceMinimumVertexCoverAlgorithm

public final transient GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet> bruteForceMinimumVertexCoverAlgorithm

branchingMinimumVertexCoverAlgorithm

public final transient GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet> branchingMinimumVertexCoverAlgorithm

NiedermeierMinimumVertexCoverAlgorithm

public final transient GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet> NiedermeierMinimumVertexCoverAlgorithm

LPMaximumindependentSetAlgorithm

public final transient GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet> LPMaximumindependentSetAlgorithm

FominGrandoniKratschMaximumindependentSetAlgorithm

public final transient GrphAlgorithm<it.unimi.dsi.fastutil.ints.IntSet> FominGrandoniKratschMaximumindependentSetAlgorithm

tarjanSCC

public final GrphAlgorithm<java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet>> tarjanSCC

chordalAlgo

public final GrphAlgorithmCache<java.lang.Boolean> chordalAlgo

Constructor Detail

Grph

public Grph(java.lang.String name,
            int nbVertices,
            int nbEdges)

Method Detail
- isHypergraph
```
public boolean isHypergraph()
```
  Checks if this graph is an hypergraph or not (i.e. it has at least one hyper-edge)
  
  Returns:
  
  true if this graph is directed
- getStronglyConnectedComponents
```
public java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet> getStronglyConnectedComponents()
```
  Tarjan's algorithm. http://en.wikipedia.org/wiki/Tarjan%27 s_strongly_connected_components_algorithm
  
  Returns:
- isStronglyConnected
```
public boolean isStronglyConnected()
```
- isMixed
```
public boolean isMixed()
```
  Checks if this graph is mixed or not (i.e. at least two of its edges are of different nature)
  
  Returns:
  
  true if this graph is mixed
- toString
```
public java.lang.String toString()
```
  Overrides:
  
  toString in class java.lang.Object
- getProperties
```
public java.util.Collection<Property> getProperties()
```
  Computes the set of properties applicable to this graph.
  
  Returns:
- fromGrphText
```
public static Grph fromGrphText(java.lang.String text)
                         throws ParseException,
                                GraphBuildException
```
  Throws:
  
  ParseException
  
  GraphBuildException
- fromGrphBinary
```
public static Grph fromGrphBinary(byte[] text)
                           throws ParseException,
                                  GraphBuildException
```
  Throws:
  
  ParseException
  
  GraphBuildException
- fromGrphTextFile
```
public static Grph fromGrphTextFile(java.lang.String filename)
                             throws ParseException,
                                    org.xml.sax.SAXException,
                                    GraphBuildException,
                                    java.io.IOException
```
  Throws:
  
  ParseException
  
  org.xml.sax.SAXException
  
  GraphBuildException
  
  java.io.IOException
- fromGraphML
```
public static Grph fromGraphML(java.lang.String graphMLText)
                        throws ParseException,
                               org.xml.sax.SAXException
```
  Throws:
  
  ParseException
  
  org.xml.sax.SAXException
- fromGraphML
```
public static Grph fromGraphML(java.lang.String graphMLText,
                               java.lang.Class vPropertyClass,
                               java.lang.Class ePropertyClass)
                        throws ParseException,
                               org.xml.sax.SAXException
```
  Throws:
  
  ParseException
  
  org.xml.sax.SAXException
- loadOnlineGrph
```
public static Grph loadOnlineGrph(java.lang.String url)
                           throws ParseException,
                                  GraphBuildException,
                                  java.io.IOException
```
  Loads the graph from the given URL.
  
  Parameters:
  
  the - URL where the graph data will be read from.
  
  Returns:
  
  a new graph, build from the data at the given URL.
  
  Throws:
  
  ParseException
  
  GraphBuildException
  
  java.io.IOException
- clearCache
```
public void clearCache()
```
  Clears the cache for all algorithms that employs one.
- getPageRanking
```
public PageRank getPageRanking(java.util.Random r)
```
- postOnTheWeb
```
public java.lang.String postOnTheWeb()
                              throws java.io.IOException
```
  Post this graph this Grph website.
  
  Returns:
  
  the URL where this graph can be retrieved from.
  
  Throws:
  
  java.io.IOException
- getSpanningTree
```
public Grph getSpanningTree()
```
- getComplement
```
public Grph getComplement()
```
  Computes the complement graph for this graph.
  
  Returns:
  
  the complement graph.
- getAllOutEdgeDegrees
```
public it.unimi.dsi.fastutil.ints.IntArrayList getAllOutEdgeDegrees()
```
- getLineGraph
```
public Grph getLineGraph()
```
  Computes the line graph of this graph.
  
  Returns:
  
  the line graph.
- getLineGraph
```
public Grph getLineGraph(int n)
```
  Computes n iterations of the "line graph" operation on this graph.
  
  Parameters:
  
  n - the number of iterations to perform
  
  Returns:
  
  the n-th line graph of this graph
- isUndirectedSimpleGraph
```
public boolean isUndirectedSimpleGraph()
```
  Checks if this graph has only undirected simple edges.
  
  Returns:
  
  true, if all edges in this graph are simple edges, false otherwise.
- isDirectedSimpleGraph
```
public boolean isDirectedSimpleGraph()
```
  Checks if this graph has only directed simple edges.
  
  Returns:
  
  true if all edges in this graph are directed edges, false otherwise.
- areVerticesAdjacent
```
public boolean areVerticesAdjacent(int src,
                                   int dest)
```
  Checks if the given two vertices are connected.
  
  Parameters:
  
  src - a vertex
  
  dest - another vertex
  
  Returns:
  
  true if there exist an edge between the two given vertices.
- getEdgesAdjacentToEdge
```
public it.unimi.dsi.fastutil.ints.IntSet getEdgesAdjacentToEdge(int e)
```
  Computes the set of edges incident to vertices incident to the given edge.
  
  Parameters:
  
  e - an edge
  
  Returns:
  
  a set of edges
- getSomeEdgeConnecting
```
public int getSomeEdgeConnecting(int src,
                                 int dest)
```
  Returns an (hyper)edge or arc that connects src and dest
  
  Parameters:
  
  src -
  
  dest -
  
  Returns:
- getLocalClusteringCoefficients
```
public double[] getLocalClusteringCoefficients()
```
  Returns:
  
  a table that contains all local clustering coefficients.
- getAverageClusteringCoefficient
```
public double getAverageClusteringCoefficient()
```
  Computes the average clustering coefficient of this graph.
  
  Returns:
  
  the average clustering coefficient the of this graph.
- getClusteringCoefficient
```
public double getClusteringCoefficient(int v)
```
- getClusteringCoefficient
```
public double getClusteringCoefficient()
```
- getClusteringCoefficientDistribution
```
public toools.math.Distribution<java.lang.Double> getClusteringCoefficientDistribution()
```
- getVerticesOfDegree
```
public it.unimi.dsi.fastutil.ints.IntSet getVerticesOfDegree(int degree)
```
  Returns the subset of vertices that have a degree equal to degree. For directed graphs, no distinction is made between in-edges and out-edges. To specify this, see getVerticesOfDegree(int, DIRECTION)
  
  Parameters:
  
  degree -
  
  Returns:
- getVerticesOfDegreeAtLeast
```
public it.unimi.dsi.fastutil.ints.IntSet getVerticesOfDegreeAtLeast(int minDegree)
```
  Returns the subset of vertices that have a degree at least degree. Designed only for simple, undirected graphs
  
  Parameters:
  
  minDegree -
  
  Returns:
- getVerticesOfDegree
```
public it.unimi.dsi.fastutil.ints.IntSet getVerticesOfDegree(int degree,
                                                             Grph.DIRECTION dir)
```
  Returns the subset of vertices that have a in-degree or out-degree equal to degree, depending on the dir parameter's value.
  
  Parameters:
  
  degree -
  
  Returns:
- contains
```
public boolean contains(Grph g)
```
  Checks if this graph contains the given graph.
  
  Parameters:
  
  g -
  
  Returns:
  
  true if this graph contains the given graph, false otherwise
- getBipartiteSubgraphInducedByVertices
```
public Grph getBipartiteSubgraphInducedByVertices(it.unimi.dsi.fastutil.ints.IntSet A,
                                                  it.unimi.dsi.fastutil.ints.IntSet B)
```
  Parameters:
  
  A - a set of vertices
  
  B - a set of vertices
  
  Returns:
  
  the bipartite subgraph induced by A and B, with edges only between A and B
- getSubgraphInducedByVertices
```
public Grph getSubgraphInducedByVertices(it.unimi.dsi.fastutil.ints.IntSet vertices)
```
  Computes the subgraph induced by the given set of vertices. The class of the returned graph is the same as the class of this graph.
  
  Parameters:
  
  vertices -
  
  Returns:
  
  a new graph
- getSubgraphInducedByEdges
```
public Grph getSubgraphInducedByEdges(it.unimi.dsi.fastutil.ints.IntSet edges)
```
  Computes the subgraph induced by the given set of edges. The class of the returned graph is the same as the class of this graph.
  
  Parameters:
  
  edges -
  
  Returns:
  
  a new graph
- highlightVertices
```
public void highlightVertices(it.unimi.dsi.fastutil.ints.IntSet vertices,
                              int color)
```
  Assigns the given color to all vertices in the given set. This operation dynamically changes the graphical representations of this graph.
  
  Parameters:
  
  vertices - the set of vertices for which the color will be set
  
  color - the color to assign to vertices
- highlightVertices
```
public void highlightVertices(int... vertices)
```
- highlightEdges
```
public void highlightEdges(it.unimi.dsi.fastutil.ints.IntSet edges,
                           int color)
```
  Assigns the given color to all edges in the given set. This operation dynamically changes the graphical representations of this graph.
  
  Parameters:
  
  edges - the set of edges for which the color will be set
  
  color - the color to assign to edges
- highlight
```
public void highlight(Grph subgraph)
```
  Assigns the given color to all vertices and edges in the given graph. This operation dynamically changes the graphical representations of this graph.
  
  Parameters:
  
  subgraph - the graph that must be selected
  
  color - the color to assign to the graph
- highlight
```
public void highlight(Grph subgraph,
                      int color)
```
- getShortestCycle
```
public it.unimi.dsi.fastutil.ints.IntSet getShortestCycle()
```
- getGirth
```
public int getGirth()
```
  The girth of a graph is defined as the length of a shortest cycle, or infinite if the graph is acyclic. Since we cannot test infinity, the girth of an acyclic graph is here defined as 0.
  
  Returns:
  
  the girth of the graph
- isIsomorphicTo
```
public boolean isIsomorphicTo(Grph anotherGraph)
```
  Returns true if this graph is isomorphic to the given graph, false otherwise.
- getPartialSubgraphIsomorphism
```
public java.util.Collection<Matching> getPartialSubgraphIsomorphism(Grph pattern,
                                                                    boolean findAllSolutions)
```
  Returns if the given "pattern graph" is partially isomorphic to a subgraph in this graph.
- getInducedSubgraphIsomorphism
```
public java.util.List<Matching> getInducedSubgraphIsomorphism(Grph pattern,
                                                              boolean findAllSolutions)
```
  Returns if the given "pattern graph" is isomorphic to a subgraph in this graph.
- isDominatingSet
```
public boolean isDominatingSet(it.unimi.dsi.fastutil.ints.IntSet s)
```
  Tests if the given set in a dominating set of this graph.
  
  Parameters:
  
  s -
  
  Returns:
- isIndependentSet
```
public boolean isIndependentSet(it.unimi.dsi.fastutil.ints.IntSet s)
```
  Tests if the given set is an independent set (a.k.a. stable set)
  
  Parameters:
  
  s -
  
  Returns:
- isMatching
```
public boolean isMatching(it.unimi.dsi.fastutil.ints.IntSet s)
```
  Computes if the given set of edges forms a matching of this graph.
  
  Parameters:
  
  s -
  
  Returns:
- isVertexCover
```
public boolean isVertexCover(it.unimi.dsi.fastutil.ints.IntSet s)
```
  Tests if the given set in a vertex cover of this graph.
  
  Parameters:
  
  s -
  
  Returns:
- getMaximumMatching
```
public it.unimi.dsi.fastutil.ints.IntSet getMaximumMatching()
```
  Computes a maximum (cardinality) matching.
  
  Returns:
  
  the edges set of a maximum matching
- getMinimumVertexCover
```
public it.unimi.dsi.fastutil.ints.IntSet getMinimumVertexCover()
```
  Computes a vertex cover of minimum cardinality. By default, the algorithm used for is Niedermeier's. You can specify another algorithm by giving its name as a parameter (see below).
  
  Returns:
- getMinimumVertexCover
```
public it.unimi.dsi.fastutil.ints.IntSet getMinimumVertexCover(Grph.MinVertexCoverAlgorithm algorithm)
```
  Computes a minimum vertex cover by applying the specified algorithm.
  
  Returns:
- getMaximumIndependentSet
```
public it.unimi.dsi.fastutil.ints.IntSet getMaximumIndependentSet()
```
  Computes a independent set of maximum cardinality, based on
  
  Returns:
- getMaximumIndependentSet
```
public it.unimi.dsi.fastutil.ints.IntSet getMaximumIndependentSet(Grph.MaxIndependentSetAlgorithm algorithm)
```
- getNumberOfTriangles
```
public int getNumberOfTriangles()
```
  Computes the number of triangles in the graph.
  
  Returns:
  
  the number of triangles.
- listCachingGraphAlgorithms
```
public final java.util.Collection<GrphAlgorithmCache> listCachingGraphAlgorithms()
```
  Lists all graph algorithms that employ a cache.
  
  Returns:
  
  all caching algorithms
- findAlgorithm
```
public GrphAlgorithm findAlgorithm(java.lang.String name)
```
- connectToKClosestNeighbors
```
public void connectToKClosestNeighbors(int k)
```
  Connect each vertex to its k-closest neighbours, according to the current topology.
  
  Parameters:
  
  k - the number of neighbours to connect to.
- grid
```
public void grid(int width,
                 int height)
```
  Connect vertices currently in the graph as a grid of dimension (w, h).
  
  Parameters:
  
  width -
  
  height -
- dgrid
```
public void dgrid(int width,
                  int height)
```
  Connect vertices currently in the graph as a DIRECTED grid of dimension (w, h).
  
  Parameters:
  
  width -
  
  height -
- grid
```
public void grid(int width,
                 int height,
                 boolean directed,
                 boolean createDiagonal,
                 boolean secondaryDiagonal)
```
  Connect vertices currently in the graph as a grid of dimension (w, h).
  
  Parameters:
  
  width -
  
  height -
  
  directed - indicated whether created edges should be directed or not
  
  createDiagonal - indicates whether diagonals edges should be created or not
- addSimpleEdge
```
public final int addSimpleEdge(int src,
                               int dest,
                               boolean directed)
```
  Connects the given vertices with a simple edge created on-the-fly. Whether the new edge will be directed or not depends on the directed parameter.
  
  Parameters:
  
  src - a vertex
  
  dest - another vertex
  
  directed - whether edges are directed or not
  
  Returns:
  
  the newly created edge
- addSimpleEdge
```
public final void addSimpleEdge(int src,
                                int edge,
                                int dest,
                                boolean directed)
```
  Connects the given vertices with the given simple edge. Whether the new edge will be directed or not depends on the directed parameter.
  
  Parameters:
  
  src - a vertex
  
  dest - another vertex
  
  edge - the edge that will connect the two vertices
  
  directed - whether edges are directed or not
- isCut
```
public boolean isCut(it.unimi.dsi.fastutil.ints.IntSet a,
                     it.unimi.dsi.fastutil.ints.IntSet b)
```
  Computes if the two given sets form a cut of this graph.
  
  Parameters:
  
  a - a set of vertices
  
  b - another set of vertices
  
  Returns:
  
  true if the two sets form a cut of this graph, false otherwise.
- isCut
```
public boolean isCut(it.unimi.dsi.fastutil.ints.IntSet... setsOfVertices)
```
  Computes if the given sets form a cut of this graph.
  
  Parameters:
  
  setsOfVertices - sets of vertices
  
  Returns:
  
  true if the sets form a cut of this graph, false otherwise.
- rnws
```
public void rnws(int k,
                 double p)
```
  Connects the vertices in the graph according to the Random-Newman-Watts-Strogatz topology generation scheme.
  
  Parameters:
  
  k - the distance of the neighbours to which each vertex is attached
  
  p - the probability to create a shortcut for any pair
- rnws
```
public void rnws(int numberOfVertices,
                 int k,
                 double p)
```
- getCutEdges
```
public it.unimi.dsi.fastutil.ints.IntSet getCutEdges(it.unimi.dsi.fastutil.ints.IntSet a,
                                                     it.unimi.dsi.fastutil.ints.IntSet b)
```
  Computes the edges describing the cut formed by the two given sets.
  
  Parameters:
  
  a - a set of vertices
  
  b - another set of vertices
  
  Returns:
  
  the set of edges describing the cut
- getCutSize
```
public int getCutSize(it.unimi.dsi.fastutil.ints.IntSet a,
                      it.unimi.dsi.fastutil.ints.IntSet b)
```
  Compute the size of the cut.
  
  Parameters:
  
  a - a set of vertices
  
  b - another set of vertices
  
  Returns:
  
  the size of the cut
- disconnect
```
public final void disconnect(int src,
                             int destination)
```
  Disconnect the two given vertices.
  
  Parameters:
  
  src - a vertex
  
  destination - another vertex
- ring
```
public void ring(boolean directed)
```
- ring
```
public void ring(it.unimi.dsi.fastutil.ints.IntSet vertices,
                 boolean directed)
```
- dring
```
public void dring()
```
  Creates a directed ring consisting of the vertices already in the graph.
- ring
```
public void ring()
```
  Creates an undirected ring consisting of the vertices already in the graph.
- removeVertices
```
public void removeVertices(int... vertices)
```
  Removes the given vertices from the graph. Incident simple edges are also removed. Hyperedges are kept.
  
  Parameters:
  
  vertices - the vertices to be removed
- removeEdges
```
public void removeEdges(it.unimi.dsi.fastutil.ints.IntSet edges)
```
  Removes the given vertices from the graph. Incident simple edges are also removed. Hyperedges are kept.
  
  Parameters:
  
  vertices - the set of vertices to be removed
- getEccentricity
```
public int getEccentricity(int v,
                           NumericalProperty weights)
```
  Computes the eccentricity of the given vertex.
  
  Parameters:
  
  v -
  
  Returns:
- getEccentricity
```
public int getEccentricity(int v)
```
- equals
```
public boolean equals(java.lang.Object o)
```
  Checks if this graph contains the given graph.
  
  Overrides:
  
  equals in class java.lang.Object
  
  Parameters:
  
  backingGrph -
  
  Returns:
  
  true if this graph contains the given graph, false, otherwise.
- equals
```
public boolean equals(Grph g)
```
  Checks if this graph equals the given graph.
  
  Parameters:
  
  g -
  
  Returns:
  
  true if this graph contains the given graph.
- getDifference
```
public final java.lang.String getDifference(Grph g)
```
  Compares this graph and the given graph and returns the first difference found.
  
  Parameters:
  
  g -
  
  Returns:
  
  the first difference that is found between the two graphs.
- getEdgeNature
```
public grph.Grph.EDGE_NATURE getEdgeNature(int e)
```
  Gets the nature of the given edge (undirected simple edge, directed simple edge, undirected hyper-edge or directed-hyperedge).
  
  Parameters:
  
  e -
  
  Returns:
- undirectionalizeEdge
```
public void undirectionalizeEdge(int e)
```
- revertEdge
```
public void revertEdge(int e)
```
- getEdgesIncidentTo
```
public it.unimi.dsi.fastutil.ints.IntSet getEdgesIncidentTo(int v)
```
  Computes the set of edges incident to the given vertex.
  
  Parameters:
  
  thisVertex - a vertex
  
  Returns:
  
  a set of edges
- clear
```
public void clear()
```
  Clears this graph. All vertices and edges are removed.
- getOutEdges
```
public toools.collections.primitive.LucIntSet getOutEdges(int v)
```
  Computes the set of out-edges for the given vertex. This set may contain edges or any types.
  
  Parameters:
  
  v - a vertex
  
  Returns:
  
  a set of edges
- getInEdges
```
public toools.collections.primitive.LucIntSet getInEdges(int v)
```
  Computes the set of out-edges for the given vertex. This set may contain edges or any types.
  
  Parameters:
  
  v - a vertex
  
  Returns:
  
  a set of edges
- getOutNeighbors
```
public toools.collections.primitive.LucIntSet getOutNeighbors(int v)
```
  Computes the set of out-neighbors of the given vertex. Since this operation is frequent, its result is cached.
  
  Parameters:
  
  v -
  
  Returns:
- getOutOnlyEdges
```
public toools.collections.primitive.LucIntSet getOutOnlyEdges(int v)
```
- getInOnlyEdges
```
public toools.collections.primitive.LucIntSet getInOnlyEdges(int v)
```
- getInOutOnlyEdges
```
public toools.collections.primitive.LucIntSet getInOutOnlyEdges(int v)
```
- addUndirectedSimpleEdge
```
public int addUndirectedSimpleEdge(int v1,
                                   int v2)
```
  Adds an edge connecting the two given vertices.
  
  Parameters:
  
  v1 - a vertex
  
  v2 - another vertex
  
  Returns:
  
  the new edge
- addVertex
```
public int addVertex()
```
  Creates a new vertex in the graph. This new vertex will be the lowest natural number available.
  
  Returns:
  
  the newly created vertex
- getInElements
```
protected it.unimi.dsi.fastutil.ints.IntSet getInElements(int v)
```
- isSimpleEdge
```
public boolean isSimpleEdge(int edge)
```
  Checks if the given edge is a simple edge.
  
  Parameters:
  
  edge - an edge
  
  Returns:
  
  true if the given edge is a simple one, false otherwise
- isHyperEdge
```
public boolean isHyperEdge(int e)
```
- disconnectVertex
```
public void disconnectVertex(int v)
```
  Disconnect the given vertex, i.e. remove all edges incident to it.
  
  Parameters:
  
  v - the vertex to be isolated
- getInNeighbours
```
public it.unimi.dsi.fastutil.ints.IntSet getInNeighbours(int v)
```
- getVerticesIncidentToEdge
```
public toools.collections.primitive.LucIntSet getVerticesIncidentToEdge(int e)
```
  Computes the set of vertices incident to the given edge.
  
  Parameters:
  
  thisEdge -
  
  Returns:
- main
```
public static void main(java.lang.String[] args)
```
- clone
```
public final Grph clone()
```
  Computes a clone of this graph.
  
  Overrides:
  
  clone in class java.lang.Object
- findPropertyByName
```
public Property findPropertyByName(java.lang.String name)
```
- getTopologyListeners
```
public java.util.List<TopologyListener> getTopologyListeners()
```
  Obtains the list of topology listeners for this graph.
  
  Returns:
  
  the list of listeners
- isDirected
```
public boolean isDirected()
```
  Checks if this graph is directed or not (i.e. all its edges are directed)
  
  Returns:
  
  true if this graph is directed
- toGrphText
```
public java.lang.String toGrphText()
```
  Computes a native-Grph textual expression of this graph.
  
  Returns:
  
  an ASCII expression for this graph.
- toEdgeList
```
public java.lang.String toEdgeList()
```
- toTextADJ
```
public java.lang.String toTextADJ()
```
- toGrphBinary
```
public byte[] toGrphBinary()
```
  Computes a native-Grph binary expression of this graph.
  
  Returns:
  
  an binary expression for this graph.
- toGraphML
```
public java.lang.String toGraphML()
```
  Computes a GraphML (XML) expression of this graph.
  
  Returns:
  
  Computes a string containing the GraphML (XML) expression of this graph.
- toDot
```
public java.lang.String toDot()
```
  Computes a GraphViz expression of this graph.
  
  Returns:
  
  Computes a string containing a GraphViz expression of this graph.
- getDiameter
```
public int getDiameter()
```
  Computes the exact diameter of this graph. The value is cached until the graph has changed.
  
  Returns:
  
  the diameter the of this graph.
- computeMaxFlow
```
public MaxFlowAlgorithmResult computeMaxFlow(int s,
                                             int t,
                                             NumericalProperty weights)
```
  Computes the maximum flow from the given source to the given destination. There must exist a path between the source and the destination.
  
  Parameters:
  
  s - a source vertex
  
  t - a destination vertex
  
  Returns:
  
  the result of the maxflow algorithms, which consists in the value for the flow as well as flow assignments for every edge involved.
- getDensity
```
public double getDensity()
```
  Computes the exact density of this graph. The value is cached until the graph has changed.
  
  Returns:
  
  the diameter the of this graph.
- getRadius
```
public int getRadius()
```
  Computes the exact radius of this graph. The value is cached until the graph has changed.
  
  Returns:
  
  the diameter the of this graph.
- isNull
```
public boolean isNull()
```
  Checks if this graph is a null graph.
  
  Returns:
  
  true if this graph is a null graph, false otherwise.
- isTrivial
```
public boolean isTrivial()
```
  Checks if this graph is a trivial graph.
  
  Returns:
  
  true if this graph is a trivial graph.
- getMaxInEdgeDegrees
```
public int getMaxInEdgeDegrees()
```
- getMaxOutEdgeDegrees
```
public int getMaxOutEdgeDegrees()
```
- getMinInEdgeDegrees
```
public int getMinInEdgeDegrees()
```
- getMinOutEdgeDegrees
```
public int getMinOutEdgeDegrees()
```
- getMaxInVertexDegrees
```
public int getMaxInVertexDegrees()
```
- getMaxOutVertexDegrees
```
public int getMaxOutVertexDegrees()
```
- getMinInVertexDegrees
```
public int getMinInVertexDegrees()
```
- getMinOutVertexDegrees
```
public int getMinOutVertexDegrees()
```
- isComplete
```
public boolean isComplete()
```
  Checks if this graph is a complete graph.
  
  Returns:
  
  true if this graph is a complete graph, false otherwise.
- isConnected
```
public boolean isConnected()
```
  Checks if this graph is made of one single partition
  
  Returns:
  
  true if this graph is a connected graph, false otherwise.
- isReflexive
```
public boolean isReflexive()
```
  Checks if this graph is a reflexive graph.
  
  Returns:
  
  true if this graph is a reflexive graph, false otherwise.
- isRegular
```
public boolean isRegular()
```
  Checks if this graph is a regular graph.
  
  Returns:
  
  true if this graph is a regular graph, false otherwise.
- getEdgePairs
```
public java.util.Collection<VertexPair> getEdgePairs()
```
- getNumberOfHyperEdges
```
public int getNumberOfHyperEdges()
```
  Returns:
  
  the number of hyper edges in this graph.
- getNumberOfSimpleEdges
```
public int getNumberOfSimpleEdges()
```
  Returns:
  
  the number of simple edges in this graph.
- getNumberOfDirectedEdges
```
public int getNumberOfDirectedEdges()
```
  Returns:
  
  the number of directed edges in this graph.
- getNumberOfUndirectedEdges
```
public int getNumberOfUndirectedEdges()
```
  Returns:
  
  the number of undirected edges in this graph.
- hasMultipleEdges
```
public boolean hasMultipleEdges()
```
  Checks if this graph is has multiple edges in it.
  
  Returns:
  
  true if this graph has multiple edges, false otherwise.
- isTree
```
public boolean isTree()
```
  Checks if this graph is a tree.
  
  Returns:
  
  true if this graph is a tree, false otherwise.
- getVersion
```
public static toools.Version getVersion()
```
  Computes the version of the Grph library installed.
  
  Returns:
  
  a string denoting the version of Grph.
- displayReport
```
public void displayReport()
                   throws java.io.IOException
```
  Throws:
  
  java.io.IOException
- display
```
public void display()
```
  Display this graph in a graphical frame, using automatic layout.
- displaySVGSalamander
```
public void displaySVGSalamander()
```
- createSwingRenderer
```
public javax.swing.JComponent createSwingRenderer()
```
- performRandomTopologicalChange
```
public void performRandomTopologicalChange(java.util.Random r)
```
  Performs a random change in this graph.
  
  Parameters:
  
  r -
- addDirectedSimpleEdge
```
public int addDirectedSimpleEdge(int tail,
                                 int head)
```
  Adds an arc connecting the given source and destination vertices.
  
  Parameters:
  
  tail - the source of the arc
  
  head - the destination of the arc
  
  Returns:
  
  the value of the new arc
- getIsolatedVertices
```
public it.unimi.dsi.fastutil.ints.IntSet getIsolatedVertices()
```
  Computes the set of isolated vertices in this graph.
  
  Returns:
  
  a set of vertices
- getOrder
```
public int getOrder()
```
  Computes the order of this graph.
  
  Returns:
  
  the order of this graph.
- getNumberOfVertices
```
public int getNumberOfVertices()
```
  Computes the number of vertices in this graph.
  
  Returns:
  
  the number of vertices in this graph.
- getNeighbours
```
public toools.collections.primitive.LucIntSet getNeighbours(int v)
```
  Computes the set of neighbors of the given vertex, cumulating in and out neighbors.
  
  Parameters:
  
  v - a vertex
  
  Returns:
  
  the set of neighbors of v
- getNeighbours
```
public it.unimi.dsi.fastutil.ints.IntSet getNeighbours(it.unimi.dsi.fastutil.ints.IntSet s)
```
  Computes the (open) neighborhood of the set s of vertices (that is the set of vertices that have at least one neighbour in s, and do not belong to s)
  
  Parameters:
  
  s - a set of vertices
  
  Returns:
  
  the set of (open) neighbors of s
- getVertexDegree
```
public int getVertexDegree(int v,
                           Grph.TYPE type,
                           Grph.DIRECTION dir)
```
  Computes different types of degrees of the given vertex.
  
  Parameters:
  
  v - a vertex
  
  type - the type of degree (edge or vertex)
  
  dir - the direction of the degree (in or out)
  
  Returns:
  
  the value of the specified degree
- getEdgeDegree
```
public int getEdgeDegree(int v)
```
- getVertexDegree
```
public int getVertexDegree(int v)
```
- getGpmetisPartitionning
```
public java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet> getGpmetisPartitionning(int numberOfPartitions,
                                                                                       java.util.Random r)
```
- getGpmetisPartitionning
```
public java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet> getGpmetisPartitionning(int numberOfPartitions,
                                                                                       Gpmetis.Ptype ptype,
                                                                                       Gpmetis.Ctype ctype,
                                                                                       Gpmetis.Iptype iptype,
                                                                                       Gpmetis.Objtype objtype,
                                                                                       boolean contig,
                                                                                       boolean minconn,
                                                                                       int ufactor,
                                                                                       int niter,
                                                                                       int ncuts,
                                                                                       java.util.Random r)
```
- getInEdgeDegree
```
public int getInEdgeDegree(int v)
```
- getInVertexDegree
```
public int getInVertexDegree(int v)
```
- getOutEdgeDegree
```
public int getOutEdgeDegree(int v)
```
- getOutVertexDegree
```
public int getOutVertexDegree(int v)
```
- getEdgesConnecting
```
public it.unimi.dsi.fastutil.ints.IntSet getEdgesConnecting(int src,
                                                            int dest)
```
- addHyperEdge
```
public void addHyperEdge(int edge,
                         int... vertices)
```
- getInNeighbors
```
public toools.collections.primitive.LucIntSet getInNeighbors(int v)
```
- getNeighbours
```
public toools.collections.primitive.LucIntSet getNeighbours(int vertex,
                                                            Grph.DIRECTION direction)
```
- getKClosestNeighbors
```
public it.unimi.dsi.fastutil.ints.IntSet getKClosestNeighbors(int vertex,
                                                              int k,
                                                              NumericalProperty edgeWeights)
```
- getNeighborsAtMaxDistance
```
public it.unimi.dsi.fastutil.ints.IntSet getNeighborsAtMaxDistance(int vertex,
                                                                   int maxDistance,
                                                                   NumericalProperty p)
```
- getNeighboursAtMostKHops
```
public it.unimi.dsi.fastutil.ints.IntSet getNeighboursAtMostKHops(int k,
                                                                  int v)
```
- getFringes
```
public java.util.List<it.unimi.dsi.fastutil.ints.IntSet> getFringes(int numberOfHops,
                                                                    int root)
```
- getLoops
```
public it.unimi.dsi.fastutil.ints.IntSet getLoops(int v)
```
  Computes the set of self-loops incident to the given vertex
  
  Parameters:
  
  v - any vertex belonging to the graph
  
  Returns:
  
  the set of self-loops (edges) incident to v
- isLoop
```
public boolean isLoop(int edge)
```
  Checks whether the given edge is a self-loop or not.
  
  Returns:
  
  true if the given edge is a loop
- hasLoop
```
public boolean hasLoop(int v)
```
  Checks if the given vertex has self-loops on it.
  
  Parameters:
  
  v - a vertex
  
  Returns:
  
  true if vertex v has a loop, false otherwise
- getInaccessibleVertices
```
public it.unimi.dsi.fastutil.ints.IntSet getInaccessibleVertices()
```
  Returns a set of vertices that are inaccessible (e.g. no edge head to them)
  
  Parameters:
  
  -
  
  -
  
  graph -
  
  Returns:
- getConnectedComponents
```
public java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet> getConnectedComponents()
```
  Computes the set of connected component on this graph.
  
  Returns:
  
  a set of vertex sets, each described a connected component
- chain
```
public void chain(boolean directed)
```
  Connect the vertices in this graph as chain.
  
  Parameters:
  
  directed - whether edges should be directed or not
- getConnectedComponentContaining
```
public it.unimi.dsi.fastutil.ints.IntSet getConnectedComponentContaining(int vertex,
                                                                         Grph.DIRECTION direction)
```
  Computes the connected component containing the given vertex, according to the given search direction.
  
  Parameters:
  
  vertex - a vertex
  
  direction - a direction (in, out or in_out)
  
  Returns:
  
  a set of edges describing the connected component
- isSimple
```
public boolean isSimple()
```
  Checks if this graph is a simple graph
  
  Returns:
  
  true is this graph is a simple graph, false otherwise.
- isIrreflexive
```
public boolean isIrreflexive()
```
  Checks if this graph is an irreflexive graph
  
  Returns:
  
  true is this graph is an irreflexive graph, false otherwise.
- getDegreeDistribution
```
public toools.math.Distribution<java.lang.Integer> getDegreeDistribution(Grph.TYPE type,
                                                                         Grph.DIRECTION dir)
```
  Computes a degree distribution for this graph
  
  Parameters:
  
  type - the type of the distribution (edge or vertex)
  
  dir - the direction (in, out or in_out)
  
  Returns:
  
  the distribution object
- isSimplicial
```
public boolean isSimplicial(int v)
```
  Checks if the given vertex is a simplicial one.
  
  Parameters:
  
  v - a vertex
  
  Returns:
  
  true if vertex v is simplicial, false otherwise.
- prune
```
public it.unimi.dsi.fastutil.ints.IntSet prune(boolean recursive)
```
  Prunes this graph (remove leaves)
  
  Parameters:
  
  recursive - if pruning should continue while there are still leaves in this graph
  
  Returns:
- removeVertices
```
public it.unimi.dsi.fastutil.ints.IntSet removeVertices(java.util.function.IntPredicate filter,
                                                        boolean recursive)
```
  Removes all vertices matching the given filter.
  
  Parameters:
  
  filter - a vertex filter
  
  recursive -
  
  Returns:
  
  the set of removed vertices
- isClique
```
public boolean isClique(it.unimi.dsi.fastutil.ints.IntSet s)
```
  Checks if the given set of vertices describes a clique in this graph.
  
  Parameters:
  
  s - a set of vertices
  
  Returns:
  
  true if s is a clique in this graph, false otherwise.
- hasCycles
```
public boolean hasCycles(int src)
```
  Checks if this graph has a cycle, by initiating the search from the given source. This method is useful in the case of digraphs.
  
  Parameters:
  
  src - a vertex
  
  Returns:
  
  true if a cycle has been found, false otherwise.
- sortTopologically
```
public it.unimi.dsi.fastutil.ints.IntArrayList sortTopologically()
```
  Topological sort of the vertices in this graph.
  
  Returns:
- getAllInEdgeDegrees
```
public it.unimi.dsi.fastutil.ints.IntArrayList getAllInEdgeDegrees()
```
- addNVertices
```
public it.unimi.dsi.fastutil.ints.IntSet addNVertices(int n)
```
  Creates n vertices in this graph.
  
  Parameters:
  
  n - the number of vertices to be created.
- isCyclic
```
public boolean isCyclic()
```
  Checks whether this graph is cyclic or not (o circuit in the case of digraphs).
  
  Returns:
  
  true is this graph has at least one cycle (or circuit).
- glp
```
public void glp()
```
  Computes a GLP topology from the vertices in the graph.
- getAverageDegree
```
public double getAverageDegree()
```
  Computes the average degree of this graph.
  
  Returns:
  
  the average degree
- getAverageDegree
```
public double getAverageDegree(Grph.TYPE type,
                               Grph.DIRECTION direction)
```
  Computes the average degree of this graph.
  
  Parameters:
  
  type - the type of degree (edge or vertex)
  
  direction - the direction (in, out, in_out)
  
  Returns:
  
  the average degree
- getShortestPath
```
public SearchResultWrappedPath getShortestPath(int source,
                                               int destination,
                                               NumericalProperty edgeWeights)
```
  Computes a shortest path from the given source to the given destination.
  
  Parameters:
  
  source - a vertex
  
  destination - another vertex
  
  Returns:
  
  a shortest path from source to destination, or null if no path can be found.
- getShortestPath
```
public Path getShortestPath(int source,
                            int destination)
```
- bfs
```
public SearchResult bfs(int source)
```
  Performs a BFS from the given vertex.
  
  Parameters:
  
  source - a vertex to start the BFS from.
  
  Returns:
  
  the data that could be computed along the BFS.
- bfs
```
public SearchResult[] bfs(toools.collections.primitive.LucIntSet sources)
```
- containsAPath
```
public boolean containsAPath(int source,
                             int destination)
```
- getOutNeighborhoods
```
public int[][] getOutNeighborhoods()
```
  Computes the vertex adjacency of the graph in the form of a two-dimension int array. This is useful for performance reasons and should be used when the graph does not change very often. The set of vertices adjacent to vertex v are found in the array getVertexAdjacencies()[v]
  
  Returns:
- getInNeighborhoods
```
public int[][] getInNeighborhoods()
```
- getNeighborhoods
```
public int[][] getNeighborhoods()
```
- getNeighbors
```
public int[][] getNeighbors(Grph.DIRECTION direction)
```
- getTwoSweepBFSDiameterApproximatedDiameter
```
public int getTwoSweepBFSDiameterApproximatedDiameter()
```
  Computues a two-sweeps approximation of the diameter of this graph. This algorithm is adequante to simple graphs.
  
  Returns:
  
  an approximation of the diameter.
- clique
```
public void clique()
```
  Connect all vertices in this graph as a clique.
- isAntigraph
```
public boolean isAntigraph()
```
  Checks whether this graph is an antigraph.
  
  Returns:
  
  true if this graph is an antigraph, false otherwise.
- getAllPaths
```
public java.util.Collection<Path> getAllPaths()
```
- getAllCycles
```
public java.util.Set<Path> getAllCycles()
```
- getDistanceMatrix
```
public DistanceMatrix getDistanceMatrix(NumericalProperty edgeWeights)
```
  Computes a distance matrix for this graph.
  
  Returns:
  
  a distance matrix.
- getAdjacencyMatrix
```
public AdjacencyMatrix getAdjacencyMatrix()
```
  Computes a adjacency matrix for this graph.
  
  Returns:
  
  a adjacency matrix.
- getIncidenceMatrix
```
public toools.math.IntMatrix getIncidenceMatrix()
```
  Computes a incidence matrix for this graph.
  
  Returns:
  
  a incidence matrix.
- removeVertices
```
public void removeVertices(it.unimi.dsi.fastutil.ints.IntSet s)
```
  Deletes the given vertices from the graph.
  
  Parameters:
  
  s - the set of vertices to be removed from the graph.
- addVertices
```
public void addVertices(it.unimi.dsi.fastutil.ints.IntSet s)
```
- sortVerticesByDegree
```
public int[] sortVerticesByDegree()
```
  Sort all vertices by degree.
  
  Returns:
  
  a degree-sorted array of all vertices.
- toGraphviz
```
public toools.io.file.RegularFile toGraphviz(GraphvizImageWriter.COMMAND cmd,
                                             GraphvizImageWriter.OUTPUT_FORMAT outputFormat,
                                             toools.io.file.Directory destination)
                                      throws java.io.IOException
```
  Computes a graphic file containing a representation of this graph generated by GraphViz.
  
  Parameters:
  
  cmd - the command to use (dot, neato, etc)
  
  outputFormat - the format for the graphic data (PNG, PDF, etc)
  
  destination - the directory where the graphic file will be written to
  
  Returns:
  
  the generated graphviz file
  
  Throws:
  
  java.io.IOException
- toGraphviz
```
public toools.io.file.RegularFile toGraphviz(GraphvizImageWriter.COMMAND cmd,
                                             GraphvizImageWriter.OUTPUT_FORMAT outputFormat)
```
- isSource
```
public boolean isSource(int v)
```
  Checks if the given vertex is a source.
  
  Parameters:
  
  v - a vertex in the graph
  
  Returns:
  
  true if the vertex is a source one, false otherwise.
- isSink
```
public boolean isSink(int v)
```
  Checks if the given vertex is a sink.
  
  Parameters:
  
  v - a vertex in the graph
  
  Returns:
  
  true if the vertex is a sink one, false otherwise.
- isLeaf
```
public boolean isLeaf(int v)
```
  Checks if the given vertex is a leaf.
  
  Parameters:
  
  v - a vertex in the graph
  
  Returns:
  
  true if the vertex is a leaf, false otherwise.
- getLargestConnectedComponent
```
public it.unimi.dsi.fastutil.ints.IntSet getLargestConnectedComponent()
```
  Determines the largest connected component in the graph.
  
  Returns:
  
  the set of vertices describing the largest connected component in the graph
- getDescription
```
public java.lang.String getDescription()
```
  Computes a textual description for this graph.
  
  Returns:
  
  a textual description of not specified form.
- ensureNVertices
```
public void ensureNVertices(int n)
```
  Ensure this graph has at least the specified amount of vertices. If not, additional vertices will be created.
  
  Parameters:
  
  n - the minimum number of vertices required for this graph.
- getMaximumClique
```
public it.unimi.dsi.fastutil.ints.IntSet getMaximumClique()
```
  Computes the maximum clique in this graph, using an ant-based algorithm defined by Chistine Solnon. This algorithm is implemented in C.
  
  Returns:
  
  a set of vertices describing the clique
- isChordal
```
public boolean isChordal()
```
  Checks if this graph is chordal or not.
  
  Returns:
  
  true if this graph is chordal, false otherwise.
- getSimplicialVertices
```
public it.unimi.dsi.fastutil.ints.IntSet getSimplicialVertices()
```
  Comptes the set of simplitial vertices in this graph.
  
  Returns:
  
  a set containing all simplitial vertices.
- highlightVertices
```
public void highlightVertices(it.unimi.dsi.fastutil.ints.IntSet vertices)
```
  Assign adequate color to the given vertices so that they distinguish clearly on graphical views of this graph.
  
  Parameters:
  
  vertices - a set of vertices to be colored (selected)
- highlightEdges
```
public void highlightEdges(it.unimi.dsi.fastutil.ints.IntSet edges)
```
- report
```
public toools.io.file.RegularFile report()
                                  throws java.io.IOException
```
  Computes a report for this graph.
  
  Returns:
  
  A reference to a PDF file containing the report.
  
  Throws:
  
  java.io.IOException
- getSources
```
public it.unimi.dsi.fastutil.ints.IntSet getSources()
```
  Computes the set of source vertices in this graph.
  
  Returns:
  
  a set containing all source vertices.
- getSinks
```
public it.unimi.dsi.fastutil.ints.IntSet getSinks()
```
  Computes the set of sink vertices in this graph.
  
  Returns:
  
  a set containing all sink vertices.
- getNumberOfEdges
```
public int getNumberOfEdges()
```
- getSize
```
public int getSize()
```
- isBipartite
```
public boolean isBipartite()
```
  Checks if this graph is bipartite.
  
  Returns:
  
  true is this graph is bipartite, false otherwise.
- clique
```
public void clique(it.unimi.dsi.fastutil.ints.IntSet s)
```
  Connect the given set of vertices as a clique.
  
  Parameters:
  
  s - a set of vertices in the graph
- highlightVertices
```
public void highlightVertices(java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet> sets)
```
- bfsList
```
public it.unimi.dsi.fastutil.ints.IntArrayList bfsList(int sourceVertex)
```
- stepMonitor
```
public AbstractStepper stepMonitor()
```
- highlight
```
public void highlight(java.util.Collection<Cluster> clusters)
```
- highlight
```
public void highlight(java.util.Collection<Cluster> clusters,
                      boolean highlightClusterHeads)
```
- highlightVertex
```
public void highlightVertex(int v,
                            int color)
```
- displayImg
```
public void displayImg()
```
- getCenter
```
public int getCenter()
```
  Retrieves the vertex at the center of the graph.
  
  Returns:
  
  the vertex at the center of the graph.
- getVerticesAccessibleThrough
```
public it.unimi.dsi.fastutil.ints.IntSet getVerticesAccessibleThrough(int vertex,
                                                                      int e)
```
- getVerticesAccessibleThrough
```
public it.unimi.dsi.fastutil.ints.IntSet getVerticesAccessibleThrough(int sourceVertex,
                                                                      it.unimi.dsi.fastutil.ints.IntSet links)
```
- hasLoops
```
public boolean hasLoops()
```
- addGraph
```
public it.unimi.dsi.fastutil.ints.Int2IntMap addGraph(Grph otherGraph)
```
- merge
```
public void merge(Grph otherGraph)
```
- contractVertices
```
public void contractVertices(int a,
                             int b)
```
  Parameters:
  
  a -
  
  b -
  
  allowMultipleEdges -
- contractVertices
```
public void contractVertices(int a,
                             int b,
                             boolean allowMultipleEdges)
```
- fromCaidaMap
```
public static Grph fromCaidaMap(toools.io.file.RegularFile f)
                         throws java.io.IOException,
                                GraphBuildException,
                                ParseException
```
  Builds a new graph from the given CAIDA map.
  
  Parameters:
  
  filename -
  
  Throws:
  
  ParseException
  
  java.io.IOException
  
  GraphBuildException
- contractEdge
```
public void contractEdge(int e)
```
- areEdgesAdjacent
```
public boolean areEdgesAdjacent(int a,
                                int b)
```
- getDefaultNumberOfThreads
```
public static int getDefaultNumberOfThreads()
```
- getKShortestPaths
```
public java.util.List<ArrayListPath> getKShortestPaths(int s,
                                                       int t,
                                                       int k,
                                                       NumericalProperty edgeWeights)
```
- getCliques
```
public java.util.Collection<it.unimi.dsi.fastutil.ints.IntSet> getCliques()
```
- getCircleStar
```
public void getCircleStar()
```
- toUndirectedGraph
```
public Grph toUndirectedGraph()
```
- toString_elements
```
public java.lang.String toString_elements()
```
- getVertexLabelProperty
```
public Property getVertexLabelProperty()
```
- setVerticesLabel
```
public void setVerticesLabel(Property verticesLabel)
```
- getEdgeLabelProperty
```
public Property getEdgeLabelProperty()
```
- setEdgesLabel
```
public void setEdgesLabel(Property edgesLabel)
```
- getVertexColorProperty
```
public NumericalProperty getVertexColorProperty()
```
- setVerticesColor
```
public void setVerticesColor(NumericalProperty verticesColor)
```
- getEdgeColorProperty
```
public NumericalProperty getEdgeColorProperty()
```
- setEdgesColor
```
public void setEdgesColor(NumericalProperty edgesColor)
```
- getEdgeWidthProperty
```
public NumericalProperty getEdgeWidthProperty()
```
- setEdgesWidth
```
public void setEdgesWidth(NumericalProperty edgesWidth)
```
- getVertexSizeProperty
```
public NumericalProperty getVertexSizeProperty()
```
- setVerticesSize
```
public void setVerticesSize(NumericalProperty verticesSize)
```
- getVertexShapeProperty
```
public NumericalProperty getVertexShapeProperty()
```
- setVerticesShape
```
public void setVerticesShape(NumericalProperty verticesShape)
```
- getEdgeStyleProperty
```
public NumericalProperty getEdgeStyleProperty()
```
- setEdgesStyle
```
public void setEdgesStyle(NumericalProperty edgesStyle)
```
- isUndirectedSimpleEdge
```
public boolean isUndirectedSimpleEdge(int u,
                                      int v)
```
- isDirectedSimpleEdge
```
public boolean isDirectedSimpleEdge(int u,
                                    int v)
```
- getOppositeEdges
```
public toools.collections.primitive.LucIntSet getOppositeEdges(int e)
```
- search
```
public SearchResult search(int v,
                           NumericalProperty edgeWeights)
```
- getFartestVertex
```
public int getFartestVertex(int v)
```
- getFartestVertex
```
public int getFartestVertex(int v,
                            NumericalProperty edgeWeights)
```
- displayGraphstream_0_4_2
```
public org.miv.graphstream.ui.GraphViewerRemote displayGraphstream_0_4_2()
```
  Display this graph in a graphical frame, using GraphStream 0.4.2.
  
  Returns:
- toGraphStream_0_4_2_AWTComponent
```
public GraphstreamBasedRenderer toGraphStream_0_4_2_AWTComponent()
```

Class Grph

Nested Class Summary

Field Summary

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Methods inherited from interface grph.UndirectedSimpleGraph

Methods inherited from interface grph.DirectedSimpleGraph

Methods inherited from interface grph.UndirectedHyperGraph

Methods inherited from interface grph.DirectedHyperGraph

Methods inherited from interface grph.DirectedGraph

Methods inherited from interface grph.UnqualifiedGraph

Methods inherited from interface grph.VertexSet

Methods inherited from interface grph.EdgeSet

Field Detail

COMPILATION_DIRECTORY

logger

useCache

HOSTS

centerAlgorithm

allClusteringCoefficientsAlgorithm

avgClusteringCoefficientAlgorithm

unweightedDistanceMatrixAlgorithm

unweightedPredecessorMatrixAlgorithm

densityAlgorithm

avgDegreeAlgorithm

diameterAlgorithm

bfsAlgorithm

radiusAlgorithm

maxInEdgeDegreeAlgorithm

maxInVertexDegreeAlgorithm

maxOutEdgeDegreeAlgorithm

maxOutVertexDegreeAlgorithm

minInEdgeDegreeAlgorithm

minInVertexDegreeAlgorithm

minOutEdgeDegreeAlgorithm

minOutVertexDegreeAlgorithm

completenessAlgorithm

connectednessAlgorithm

multigraphnessAlgorithm

reflexivityAlgorithm

regularityAlgorithm

simplenessAlgorithm

treenessAlgorithm

vertexListAlgorithm

complementAlgorithm

outNeighborsAlgorithm

inNeighborsAlgorithm

inOutNeighborsAlgorithm

vertexAdjacenciesAsIDSetsAlgorithm

lineGraphAlg

trianglesAlgorithm

isolatedVerticesAlgorithm

adjacencyMatrixAlgo

incidenceMatrixAlgo

inacessibleVertices

connectedComponentsAlg

irreflexiveAlgorithm

topologicalSortingAlg

isCyclicAlgorithm

girthAlgorithm

twoSweepDiameterAlg

bipartiteAlgorithm

LPMaxMatchingAlgorithm

LPMinVertexCoverAlgorithm

bruteForceMinimumVertexCoverAlgorithm

branchingMinimumVertexCoverAlgorithm

NiedermeierMinimumVertexCoverAlgorithm

LPMaximumindependentSetAlgorithm

FominGrandoniKratschMaximumindependentSetAlgorithm

tarjanSCC

chordalAlgo

Constructor Detail

Grph

Method Detail

isHypergraph

getStronglyConnectedComponents

isStronglyConnected

isMixed

toString