makeGraphComplete: Graph Constructor Functions

makeGraphCompleteR Documentation

Graph Constructor Functions

Description

Graph Constructor Functions

Usage

makeGraphComplete(n, type = "undirected")

makeGraphEmpty(n)

makeGraphChain(n, type = "undirected")

makeGraphCycle(n, type = "undirected")

makeGraphStar(n, type = "undirected", out = FALSE)

makeGraphGrid(n, m = n, type = "undirected")

makeGraphBipartite(n, m, type = "undirected")

Arguments

n

number of vertices (or rows for a grid)

type

type of edges to use

out

should edges be directed out from the centre?

m

number of columns or size of second set

Details

Provides some construction functions for common graphs: complete graphs, chains, cycles and stars.

Functions

  • makeGraphEmpty(): graph with no edges

  • makeGraphChain(): graph with chain of edges

  • makeGraphCycle(): graph with cycle of edges

  • makeGraphStar(): star shaped graph

  • makeGraphGrid(): grid of vertices

  • makeGraphBipartite(): bipartite graph


rje42/MixedGraphs documentation built on March 20, 2024, 8:09 a.m.