| Home | Overview | Documents | Content Dictionaries | Software & Tools | The OpenMath Society | OpenMath Projects | OpenMath Discussion Lists | OpenMath Meetings | Links |
This CD defines symbols for handling directed and undirected graphs. Authored by Hans Cuypers and Erik Postma. This version is edited by amc.
This symbol represents an undirected graph. It takes two arguments: the vertex set of the graph and the edge set. The vertices can be arbitrary OpenMath objects. Each edge should be a set consisting of two vertices.
| [Next: vertexset] [Last: target] [Top] |
This symbol represents the vertex set of a (directed or undirected) graph. It takes one argument, the graph.
| [Next: edgeset] [Previous: graph] [Top] |
This symbol represents the set of edges of an undirected graph. It takes one argument, the undirected graph.
| [Next: digraph] [Previous: vertexset] [Top] |
This symbol refers to a digraph. It has two arguments. The first is the set of vertices, the second is the set of arrows. Arrows are represented by lists of length two, where a list represents the arrow from the first element to the second.
| [Next: arrowset] [Previous: edgeset] [Top] |
This symbol represents the set of arrows of a directed graph. It takes one argument, the directed graph.
| [Next: source] [Previous: digraph] [Top] |
Given an arrow, this symbol refers to the vertex where the arrow starts. It takes one argument, the arrow.
| [Next: target] [Previous: arrowset] [Top] |
Given an arrow, this symbol refers to the vertex the arrow points to. It takes one argument, the arrow.
| [First: graph] [Previous: source] [Top] |
| Home | Overview | Documents | Content Dictionaries | Software & Tools | The OpenMath Society | OpenMath Projects | OpenMath Discussion Lists | OpenMath Meetings | Links |