NInverseFourierCoefficient[expr, n, t] gives a numerical approximation to the function, evaluated at t, whose Fourier exponential series representation has coefficients given ...
GeneralMiniMaxApproximation[{f_x, f_y}, {t, {t_0, t_1}, m, n}, x] finds the rational polynomial function of x, with numerator order m and denominator order n, that gives a ...
AdjacencyMatrix[g] gives the SparseArray object representing the graph g.AdjacencyMatrix[g, n] gives the SparseArray object representing the graph g, adding additional ...
CommunityStructurePartition[g] gives the partition of a graph g into communities.
LineScaledCoordinate[{{x_1, y_1}, {x_2, y_2}, ..., {x_k, y_k}}, r] gives the coordinate of a point in the polyline {{x_1, y_1}, {x_2, y_2}, ..., {x_k, y_k}}, at a scaled ...
NeighborhoodSubgraph[g, i, r] gives a subgraph consists of vertices that can be reached from vertex i within r hops.NeighborhoodSubgraph[g, i] gives a subgraph consists of ...
PageRanks[g] give the page rank of the graph g as a rule list.
ToCombinatoricaGraph[g] return the Combinatorica representation of the graph g.ToCombinatoricaGraph[g, n] return the graph g, adding additional unconnected vertices, if ...
DirectAgglomerate[m] constructs a cluster hierarchy based on the distance or dissimilarity matrix m.DirectAgglomerate[m, list] associates the elements of list with the rows ...
MeanDifferenceCI[list_1, list_2] gives a confidence interval for the difference between the population means estimated from list_1 and list_2.