planaritytest: Boyer-Myvold Planarity test of a network

In MEGENA: Multiscale Clustering of Geometrical Network

Description

wrapper function of _MEGENA_planaritytest. imports from Boost graph library, and test planarity of a network

Usage

planaritytest(N, rows, cols)

Arguments

N	must be an integer. number of nodes in the network.
rows	first column of edgelist. a vector of integers.
cols	second column of edgelist. a vector of integers.

Details

cbind(rows,cols) is equivalent to the two column edge list of the network. We assume that the network is undirected.

Value

TRUE/FALSE is returned to indicate planarity. (TRUE -> network is planar).

Author(s)

Won-Min Song

Examples

# test simplest case of planar network (a 3-clique).
planaritytest(as.integer(3),c(1,1,2),c(2,3,3))

Example output

Loading required package: doParallel
Loading required package: foreach
Loading required package: iterators
Loading required package: parallel
Loading required package: igraph

Attaching package: ‘igraph’

The following objects are masked from ‘package:stats’:

    decompose, spectrum

The following object is masked from ‘package:base’:

    union

[1] TRUE

MEGENA documentation built on May 1, 2019, 8:07 p.m.