createSaviGraph: Creates a random igraph based on user specifications.

In nsimone101/savi: An implementation of Simulated Annealing on Groups of Vectors

Description

Creates a random igraph based on user specifications.

Usage

createSaviGraph(graphType, graphParams)

Arguments

graphType	The graph type desired. There are two types of graphs currently available. The first is a random connected graph ("Connected"). The other is the EFL graph ("EFL"), which creates a random graph that conforms to the given conditions of the Erdős–Faber–Lovász conjecture. Note that this implementation will not create all possible EFL graphs. However, the graph created will always be an EFL graph.
graphParams	When the graph type is "Connected," the next two arguements should be the number of verticies desired and the second arguement should be the probability of each vertex connecting. Thus, this arguement should be in the interval (0,1). When the graph type is EFL, n is the number of n-complete graphs to connect together. A second argument is not needed.

Value

The newly created igraph.

Examples

    createSaviGraph("Connected",c(6,0.8))
    createSaviGraph("EFL",4)

nsimone101/savi documentation built on July 1, 2020, 4:53 a.m.