MaximalIndependentVertexSet[g] gives a maximal independent vertex set of an undirected graph g.MaximalIndependentVertexSet[g, w] gives a maximal independent vertex set of g ...
MinCut
(Graph Utilities Package Symbol) MinCut[g, k] partitions the undirected graph g into k parts where the number of edge cuts is approximately minimized.
Agglomerate[{e_1, e_2, ...}] gives an hierarchical clustering of the elements e_1, e_2, ....Agglomerate[{e_1 -> v_1, e_2 -> v_2, ...}] represents e_i with v_i in each ...
DendrogramPlot[list] constructs a dendrogram from the hierarchical clustering of list.DendrogramPlot[c] constructs a dendrogram from the Cluster object c.
MeanDifferenceTest[list_1, list_2, \[CapitalDelta]\[Mu]_0] performs a test with null hypothesis \[Mu]_1 - \[Mu]_2 = \[CapitalDelta]\[Mu]_0.
The following are some issues and considerations to be aware of when using the Notation Package and/or designing notations. It is intrinsically difficult to debug something ...
Legend
(Plot Legends Package Symbol) Legend[{{box_1, text_1}, ...}, options] generates a legend with the specified boxes and text.Legend[func, num, options] generates a legend by applying func to numbers between ...
PairwiseScatterPlot[m] creates a matrix of scatter plots comparing the data in each column of m against columns of m.
StemLeafPlot[data] creates a stem-and-leaf plot for the real-valued vector data.StemLeafPlot[data_1, data_2] creates a side-by-side stem-and-leaf plot for the vectors data_1 ...
FirstIntegrals[f, x[t], t] returns a list of first integrals corresponding to the coordinate x[t] and independent variable t of the integrand f.FirstIntegrals[f, {x[t], y[t], ...