construct a trail through a graph
list or sequence of vertices
The Trail inert function is used as a short form description of edges in a graph passing through a vertex sequence/list in the given order. For example, Trail(1,2,3,4) or Trail([1,2,3,4]) are short forms to specify a trail through the vertices that generates the edges 1,2, 2,3 and 3,4.
The Trail function is only understood by the functions that construct graphs (Graph and Digraph) as well as functions that add edges to a graph or remove edges from a graph (AddEdge, DeleteEdge, AddArc, and DeleteArc). It is also used as a return value for a specified path (IsEulerian).
G≔Graph 1: an undirected unweighted graph with 4 vertices and 4 edge(s)
G≔Graph 2: a directed unweighted graph with 4 vertices and 4 arc(s)
G≔Graph 3: an undirected unweighted graph with 4 vertices and 0 edge(s)
Graph 3: an undirected unweighted graph with 4 vertices and 4 edge(s)
G≔Graph 4: a directed unweighted graph with 4 vertices and 0 arc(s)
Graph 4: a directed unweighted graph with 4 vertices and 4 arc(s)
Download Help Document
What kind of issue would you like to report? (Optional)