Category

# Graphs & Networks

49 items

• ### BacktrackSearch

Solve computational problems using a generic backtracking algorithm

• ### BuckyballGraph

Create a graph of an order-n buckyball

• ### ButcherTreeQ

Determine if a Butcher tree is in valid functional syntax

• ### ButcherTrees

Get a list of the trees for any Runge-Kutta method of a given order

• ### CanonicalHypergraph

Find a canonical version of a directed hypergraph

• ### CayleyNestGraph

Create a generalized Cayley graph from generators and relations

• ### ChordDiagram

Make a weighted connectivity graph using circular embedding

• ### ChromaticNumber

Compute the vertex chromatic number of a graph

• ### ConnectedHypergraphQ

Determine whether a hypergraph is connected

• ### Excess01Ruler

Find a near-minimal set of integer marks so that all integers up to a given length are represented as differences

• ### FactorGraph

Get a graph representation for the factorization of an integer

• ### FindHypergraphIsomorphism

Find all isomorphisms between two orderless (undirected) hypergraphs

• ### FindOrderedHypergraphIsomorphism

Find isomorphisms between two ordered (directed) hypergraphs

• ### FindProperColorings

Find all proper k-colorings of a specified graph

• ### GeodesicSphereGraph

Create a graph of an order-n geodesic sphere

• ### GracefulGraphFromPermutation

Show the graceful graph corresponding to a given permutation

• ### GraphAntipodes

Find a pair of vertices that are a maximum distance apart on a graph

• ### GraphFunctionPlot

Plot the values of a function at the vertices of a graph

• ### GraphicsMetricGraph

Create a mesh representing a metric from a graphic

• ### GraphMinors

Enumerate the graph minors of a graph

• ### HexagonalGridGraph

Generate a graph corresponding to a hexagonal grid

• ### HexagonalTorusGraph

Return a skew graph on a torus with a given number of hexagonal cells

Get steps of Hofstadter's MU riddle

• ### HypergraphPlot

Plot a hypergraph defined by a list of hyperedges

• ### IsomorphicHypergraphQ

Determine whether two orderless (undirected) hypergraphs are isomorphic

• ### IsomorphicOrderedHypergraphQ

Determine whether two ordered (directed) hypergraphs are isomorphic

• ### KeywordsGraph

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

• ### KruskalAlgorithm

Find the minimal spanning tree for a given set of points in Euclidean space

• ### MolecularGraphAutocorrelation

Compute molecular graph autocorrelation vectors, convolved over atomic properties

• ### MongeanShuffle

Perform a Mongean shuffle on a list

• ### MouseoverHighlightGraph

Display a graph so that connected edges are highlighted when you mouse over a vertex

• ### NetChainToGraph

Convert a NetChain to a NetGraph

• ### NFAPlot

Plot a nondeterministic finite automaton

• ### NFASimulation

Simulate the behavior of a nondeterministic finite automaton

• ### PhylogeneticTreePlot

Plot a dendrogram for a set of genome nucleotide sequences

• ### PolarDendrogramPlot

Plot a polar dendrogram of a clustering

• ### QueryTreeForm

Present a query as a tree

• ### RandomHypergraph

Generate a random hypergraph

• ### ReasonableRuler

Find a near minimal set of marks for an integer length ruler so that all smaller integer distances are measurable

• ### SequenceGraph

Create a graph from a data sequence

• ### ShortestTourArt3D

Display a 3D model using a continuous line

• ### SimpleHypergraphPlot

Plot a hypergraph defined by a list of hyperedges and isolated vertices

• ### SimplexMeasure

Get the measure of a simplex or simplicial complex

• ### SynonymGraph

Create a graph of a word synonyms

• ### TransversalHypergraph

Compute the transversal hypergraph of a hypergraph defined by a list of hyperedges and isolated vertices

• ### ValidGraphColoring

Check if the given graph coloring is valid

• ### VertexCoordinateList

Return the vertex coordinates of a graph

• ### VizingEdgeColoring

Give a simple undirected graph a proper edge coloring using at most one color more than necessary

• ### WeightedDistanceGraph

Given vertices, return a complete graph with edge weights equal to edge lengths