Graph Programming

By providing a completely extensible set of vertex and edge properties, you can make graphs represent much more than the structural information embodied in their topology. For instance, vertices could contain dynamic system models and edges could contain signals, and the graph could then represent a block-diagram model. The vertex and edge properties can also be used to store the state when scanning the graph in a depth-first or breadth-first manner as used by many graph algorithms. But the Wolfram Language provides a multi-paradigm approach to graph programming with a rich set of matrix, optimization, and Boolean-based frameworks that allow for a variety of extensions to the whole graph framework.

Manipulating Vertex and Edge Properties

(RefLink[Property, paclet:ref/Property]) — property wrapper for vertices and edges

(RefLink[Properties, paclet:ref/Properties]) — option for graphs to specify vertex and edge properties

(RefLink[PropertyList, paclet:ref/PropertyList]) — give a list of available properties

(RefLink[PropertyValue, paclet:ref/PropertyValue]) — get and set vertex or edge property values

Scan-Based Algorithms

(RefLink[BreadthFirstScan, paclet:ref/BreadthFirstScan]) — scan a graph in a breadth-first order

(RefLink[DepthFirstScan, paclet:ref/DepthFirstScan]) — scan a graph in a depth-first order

(OrangeLink[Matrix-Based Algorithms », paclet:guide/MatricesAndLinearAlgebra])

(RefLink[AdjacencyMatrix, paclet:ref/AdjacencyMatrix]) — convert to a sparse adjacency matrix representation

(RefLink[AdjacencyGraph, paclet:ref/AdjacencyGraph]) — construct a graph from an adjacency matrix

(OrangeLink[Optimization-Based Algorithms », paclet:guide/Optimization])

(RefLink[Minimize, paclet:ref/Minimize]) — minimize a function with constraints

(OrangeLink[Boolean Function-Based Algorithms », paclet:guide/BooleanComputation])

(RefLink[SatisfiableQ, paclet:ref/SatisfiableQ]) — test whether a Boolean formula or function can be (RefLink[True, paclet:ref/True])