Types of Numbers (Mathematica Tutorial)

Four underlying types of numbers are built into Mathematica. Intrinsic types of numbers in Mathematica. Rational numbers always consist of a ratio of two integers, reduced to ...

CUDADilation (CUDALink Symbol)

CUDADilation[img, r] gives the morphological dilation of img with respect to a range-r square.CUDADilation[mem, r] gives the morphological dilation of list with respect to a ...

CUDAErosion (CUDALink Symbol)

CUDAErosion[img, r] gives the morphological erosion of img with respect to a range-r square.CUDAErosion[list, r] gives the morphological erosion of list with respect to a ...

CUDAImageConvolve (CUDALink Symbol)

CUDAImageConvolve[img, kern] gives the convolution of img with kern.CUDAImageConvolve[list, kern] gives the convolution of list with kern.CUDAImageConvolve[mem, kern] gives ...

CUDAOpening (CUDALink Symbol)

CUDAOpening[img, r] gives the morphological opening of img with respect to a range-r square.CUDAOpening[list, r] gives the morphological opening of list with respect to a ...

BipartiteMatchingAndCover (Combinatorica Package Symbol)

BipartiteMatchingAndCover[g] takes a bipartite graph g and returns a matching with maximum weight along with the dual vertex cover. If the graph is not weighted, it is ...

BipartiteMatching (Combinatorica Package Symbol)

BipartiteMatching[g] gives the list of edges associated with a maximum matching in bipartite graph g. If the graph is edge weighted, then the function returns a matching with ...

NormalizeVertices (Combinatorica Package Symbol)

NormalizeVertices[v] gives a list of vertices with a similar embedding as v but with the coordinates of all points scaled to be between 0 and 1.

NumberOfDirectedGraphs (Combinatorica Package Symbol)

NumberOfDirectedGraphs[n] returns the number of nonisomorphic directed graphs with n vertices. NumberOfDirectedGraphs[n, m] returns the number of nonisomorphic directed ...

NumberOfGraphs (Combinatorica Package Symbol)

NumberOfGraphs[n] returns the number of nonisomorphic undirected graphs with n vertices. NumberOfGraphs[n, m] returns the number of nonisomorphic undirected graphs with n ...