The definitive Wolfram Language and notebook experience
The original technical computing environment
All-in-one AI assistance for your Wolfram experience
We deliver solutions for the AI eraâcombining symbolic computation, data-driven insights and deep technology expertise.
Courses in computing, science, life and more
Learn, solve problems and share ideas.
News, views and insights from Wolfram
Resources for
Software DevelopersWe deliver solutions for the AI eraâcombining symbolic computation, data-driven insights and deep technology expertise.
Wolfram SolutionsCourses in computing, science, life and more
Learn, solve problems and share ideas.
News, views and insights from Wolfram
Resources for
Software DevelopersBy 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.
Scan-Based AlgorithmsBreadthFirstScan — scan a graph in a breadth-first order
DepthFirstScan — scan a graph in a depth-first order
"DiscoverVertex" ▪ "UnvisitedVertex" ▪ "PrevisitVertex" ▪ "PostvisitVertex" ▪ "FrontierEdge" ▪ "CycleEdge" ▪ "BackEdge" ▪ ...
Matrix-Based Algorithms »AdjacencyMatrix — convert to a sparse adjacency matrix representation
AdjacencyGraph — construct a graph from an adjacency matrix
IncidenceMatrix ▪ IncidenceGraph ▪ KirchhoffMatrix ▪ KirchhoffGraph
Transpose ▪ Dot ▪ Eigenvalues ▪ Eigenvectors ▪ ...
Optimization-Based Algorithms »Minimize — minimize a function with constraints
NMinimize ▪ FindMinimum ▪ ...
Boolean Function-Based Algorithms »SatisfiableQ — test whether a Boolean formula or function can be True
TautologyQ ▪ Conjunction ▪ Disjunction ▪ ...
Related Guides TopRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4