ToAdjacencyLists[g] constructs an adjacency list representation for graph g. ToAdjacencyLists[g, EdgeWeight] returns an adjacency list representation along with edge weights.

Statistical visualization is used to understand how data is distributed and how that compares to other datasets and distributions. Histograms and smooth histograms both ...

Microsoft Windows cursor. Raster image file format. Native cursor format on Windows. CUR is an acronym derived from cursor. Binary format. Can store multiple cursors at ...

SelfLoopStyle is an option for GraphPlot and related functions that specifies how to draw self-loops that connect a vertex to itself.

MakeSimple[g] gives the undirected graph, free of multiple edges and self-loops derived from graph g.

MultipleEdgesQ[g] yields True if g has multiple edges between pairs of vertices. It yields False otherwise.

RemoveMultipleEdges[g] returns the graph obtained by deleting multiple edges from g.

SimpleQ[g] yields True if g is a simple graph, meaning it has no multiple edges and contains no self-loops.

Mathematica supports not only arbitrary arrow graphics, but also a selection of convenient arrow-like characters, that automatically extend when appropriate. Each of these ...

The Mathematica function NDSolve is a general numerical differential equation solver. It can handle a wide range of ordinary differential equations (ODEs) as well as some ...