Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Category
33 items
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
Make a weighted connectivity graph using circular embedding
Compute the vertex chromatic number of a graph
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
Show the graceful graph corresponding to a given permutation
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
Present a query as a tree
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
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