Learn R Programming

mathgraph (version 0.9-6)

sort.mathgraph: Sort a Mathematical Graph

Description

Sorts nodes within undirected edges and/or edges by nodes.

Usage

sort.mathgraph(x, nodes = TRUE, edges = TRUE)

Arguments

x
an object that inherits from mathgraph.
nodes
logical value; if TRUE, then the nodes within undirected edges are sorted.
edges
logical value; if TRUE, then the edges are sorted by the first node with ties broken by the second node.

Value

  • an object that represents the same graph as the input, but with some rearrangement.

References

S Poetry, Patrick J. Burns, Section 13.3; http://www.burns-stat.com/pages/spoetry.html

See Also

mathgraph

Examples

Run this code
jjmg <- c(mathgraph(~ 4:2 * 1:3), mathgraph(~ 3:5 / 1:3))
sort.mathgraph(jjmg)
sort.mathgraph(jjmg, node=FALSE)
sort.mathgraph(jjmg, edge=FALSE)

Run the code above in your browser using DataLab