Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Category
49 items
Solve computational problems using a generic backtracking algorithm
Create a graph of an order-n buckyball
Determine if a Butcher tree is in valid functional syntax
Get a list of the trees for any Runge-Kutta method of a given order
Find a canonical version of a directed hypergraph
Create a generalized Cayley graph from generators and relations
Make a weighted connectivity graph using circular embedding
Compute the vertex chromatic number of a graph
Determine whether a hypergraph is connected
Find a near-minimal set of integer marks so that all integers up to a given length are represented as differences
Get a graph representation for the factorization of an integer
Find all isomorphisms between two orderless (undirected) hypergraphs
Find isomorphisms between two ordered (directed) hypergraphs
Find all proper k-colorings of a specified graph
Create a graph of an order-n geodesic sphere
Show the graceful graph corresponding to a given permutation
Find a pair of vertices that are a maximum distance apart on a graph
Plot the values of a function at the vertices of a graph
Create a mesh representing a metric from a graphic
Enumerate the graph minors of a graph
Generate a graph corresponding to a hexagonal grid
Return a skew graph on a torus with a given number of hexagonal cells
Get steps of Hofstadter's MU riddle
Plot a hypergraph defined by a list of hyperedges
Determine whether two orderless (undirected) hypergraphs are isomorphic
Determine whether two ordered (directed) hypergraphs are isomorphic
A weighted graph connecting frequently used keywords of a text that are sequential neighbors and thus visualizing the flow and clustering of ideas in the text
Find the minimal spanning tree for a given set of points in Euclidean space
Compute molecular graph autocorrelation vectors, convolved over atomic properties
Perform a Mongean shuffle on a list
Display a graph so that connected edges are highlighted when you mouse over a vertex
Convert a NetChain to a NetGraph
Plot a nondeterministic finite automaton
Simulate the behavior of a nondeterministic finite automaton
Plot a dendrogram for a set of genome nucleotide sequences
Plot a polar dendrogram of a clustering
Present a query as a tree
Generate a random hypergraph
Find a near minimal set of marks for an integer length ruler so that all smaller integer distances are measurable
Create a graph from a data sequence
Display a 3D model using a continuous line
Plot a hypergraph defined by a list of hyperedges and isolated vertices
Get the measure of a simplex or simplicial complex
Create a graph of a word synonyms
Compute the transversal hypergraph of a hypergraph defined by a list of hyperedges and isolated vertices
Check if the given graph coloring is valid
Return the vertex coordinates of a graph
Give a simple undirected graph a proper edge coloring using at most one color more than necessary
Given vertices, return a complete graph with edge weights equal to edge lengths