Other & Advanced

85 built-in function(s) in this category.

• $PlotLegendData — $PlotLegendData[{color1, label1}, ...] (Stable)
• $PlotResample — $PlotResample[var, {f...}, {plotPoints, maxRecursion, maxPlotPoints, mesh, regionFunction, exclusions, colorFunction, colorFunctionScaling, filling, fillingStyle}] (Experimental)
• $StreamColorBar — $StreamColorBar[speed_min, speed_max] (Experimental)
• AdjacencyGraph — AdjacencyGraph[m] builds a graph on vertices 1..n from a 0/1 adjacency matrix m (undirected if m is symmetric, else directed). (Stable)
• AdjacencyList — AdjacencyList[g] gives the adjacency list of g; AdjacencyList[g,v] gives the vertices adjacent to v (successors for directed edges). (Stable)
• AdjacencyMatrix — AdjacencyMatrix[g] gives the 0/1 adjacency matrix of g (symmetric for undirected graphs). (Stable)
• AiryAiPrime — AiryAiPrime[z] (Stable)
• AiryBiPrime — AiryBiPrime[z] (Stable)
• AspectRatio — AspectRatio (Stable)
• BarSpacing — BarSpacing (Experimental)
• BesselJZero — BesselJZero[n, k] gives the k-th positive zero of BesselJ[n, x]. Stays symbolic for symbolic arguments. (Stable)
• Black — Black (Experimental)
• Blue — Blue (Experimental)
• Brown — Brown (Experimental)
• ChartLabels — ChartLabels (Experimental)
• ChartStyle — ChartStyle (Experimental)
• CompleteGraph — CompleteGraph[n] gives the complete graph K_n on n vertices. (Stable)
• ConnectedComponents — ConnectedComponents[g] gives the connected components of g (weak, on the underlying undirected graph). (Stable)
• ConnectedGraphQ — ConnectedGraphQ[g] gives True if g is connected. (Stable)
• ContourLabels — ContourLabels (Experimental)
• ContourShading — ContourShading (Experimental)
• ContourStyle — ContourStyle (Experimental)
• Contours — Contours (Experimental)
• Cyan — Cyan (Experimental)
• CycleGraph — CycleGraph[n] gives the cycle graph on n vertices. (Stable)
• DataType — DataType[a] (Stable)
• DirectedGraphQ — DirectedGraphQ[g] gives True if all edges of g are directed. (Stable)
• EdgeCount — EdgeCount[g] gives the number of edges in the graph g. (Stable)
• EdgeList — EdgeList[g] gives the list of edges of the graph g. (Stable)
• FindShortestPath — FindShortestPath[g,s,t] gives a shortest path from s to t as a list of vertices ({} if none). (Stable)
• FindSpanningTree — FindSpanningTree[g] gives a spanning tree (forest) of g as a graph. (Stable)
• FourierParameters — FourierParameters is an option for Fourier and InverseFourier that (Experimental)
• Frame — Frame (Experimental)
• FrameStyle — FrameStyle (Experimental)
• FrameTicks — FrameTicks (Experimental)
• FresnelC — FresnelC[z] (Stable)
• FresnelS — FresnelS[z] (Stable)
• GraphDistance — GraphDistance[g,s,t] gives the length of a shortest path from s to t (Infinity if unreachable). (Stable)
• GraphPlot — GraphPlot[g] gives a Graphics object drawing the graph g with a circular vertex layout. (Stable)
• Gray — Gray (Experimental)
• Green — Green (Experimental)
• HoldFirst — HoldFirst (Experimental)
• HoldRest — HoldRest (Experimental)
• ImageSize — ImageSize (Experimental)
• IncidenceMatrix — IncidenceMatrix[g] gives the vertex-edge incidence matrix of g (oriented: -1 tail, +1 head for directed edges). (Stable)
• LightBlue — LightBlue (Experimental)
• LightBrown — LightBrown (Experimental)
• LightCyan — LightCyan (Experimental)
• LightGray — LightGray (Experimental)
• LightGreen — LightGreen (Experimental)
• LightMagenta — LightMagenta (Experimental)
• LightOrange — LightOrange (Experimental)
• LightPink — LightPink (Experimental)
• LightPurple — LightPurple (Experimental)
• LightRed — LightRed (Experimental)
• LightYellow — LightYellow (Experimental)
• Lighting — Lighting (Experimental)
• List — {e1, e2, ...} or List[e1, e2, ...] (Stable)
• Magenta — Magenta (Experimental)
• NDArrayQ — NDArrayQ[expr] (Stable)
• Orange — Orange (Experimental)
• PathGraph — PathGraph[n] gives the path on n vertices; PathGraph[{v1,...}] the path over the given vertices. (Stable)
• Pink — Pink (Experimental)
• PolynomialSqrt — PolynomialSqrt[p] gives a polynomial s with s^2 == p when p is a perfect square (every non-constant irreducible factor has even multiplicity; the numeric content is carried through Sqrt), and $Failed otherwise. PolynomialSqrt[p, x] treats p as a polynomial in x. (Stable)
• Purple — Purple (Experimental)
• RandomGraph — RandomGraph[{n, m}] gives a random undirected graph with n vertices and m edges. (Stable)
• RatCanonPrototype — RatCanonPrototype[expr] (Phase-1 prototype) reduces a rational function over the differential/algebraic tower of expr via one FLINT reduction. (Stable)
• Reap — Reap[expr] (Stable)
• Red — Red (Experimental)
• ScalingFunctions — ScalingFunctions (Experimental)
• Sow — Sow[e] (Stable)
• StringExpression — StringExpression[p1, p2, ...] or p1 ~~ p2 ~~ ... (Stable)
• StronglyConnectedComponents — StronglyConnectedComponents[g] gives the strongly connected components of g (following edge directions). (Stable)
• VectorPoints — VectorPoints (Experimental)
• VectorScale — VectorScale (Experimental)
• VectorStyle — VectorStyle (Experimental)
• VertexConnectivity — VertexConnectivity[g] gives the minimum number of vertices whose removal disconnects g. (Stable)
• VertexCount — VertexCount[g] gives the number of vertices in the graph g. (Stable)
• VertexDegree — VertexDegree[g] gives the list of vertex degrees; VertexDegree[g,v] gives the degree of vertex v. (Stable)
• VertexInDegree — VertexInDegree[g] / VertexInDegree[g,v] gives in-degrees (incoming directed edges; undirected edges count for both). (Stable)
• VertexList — VertexList[g] gives the list of vertices of the graph g. (Stable)
• VertexOutDegree — VertexOutDegree[g] / VertexOutDegree[g,v] gives out-degrees (outgoing directed edges; undirected edges count for both). (Stable)
• WeaklyConnectedComponents — WeaklyConnectedComponents[g] gives the weakly connected components of g. (Stable)
• White — White (Experimental)
• Yellow — Yellow (Experimental)