anyGraph-class {giRaph}R Documentation

Class "anyGraph"

Description

A class for graphs of any kind.

Objects from the Class

Objects can be created by calls of the form new("anyGraph", ...). An anyGraph object consists of a single slot (incidenceList) for the only possible representation.

Slots

incidenceList:
Object of class "incidenceList"

Methods

initialize
signature(.Object="anyGraph"): constructs any graph from incidence list representation
show
signature(object = "anyGraph"): displays the available representations of any graph
display
signature(x = "anyGraph"): static graphical representation via package 'mathgraph'
dynamic.Graph
signature(object = "anyGraph"): dynamic graphical representation via package 'dynamicGraph'
incidenceList<-
signature(x = "anyGraph"): sets the incidence list representation
incidenceList
signature(object = "anyGraph"): gets the incidence list representation
names
signature(x = "anyGraph"): gets the character vertex identifiers of any graph
names<-
signature(x = "anyGraph"): sets the character vertex identifiers of any graph
card
signature(object = "anyGraph"): returns the number of vertices and the total number of edge occurrences in any graph
isEmpty
signature(object = "anyGraph"): a graph object is empty if all its possible representations are empty
isPresent
signature(el = "edge", ou = "anyGraph"): an edge occurs in a graph object if it occurs in its non-empty slots
areTheSame
signature(x = "anyGraph", y = "anyGraph"): x and y are the same if their non-empty slots represent the same graph
[
signature(x = "anyGraph"): extracts an induced subgraph
[[
signature(x = "anyGraph"): extracts the character identifier of a vertex
coerce
signature(from = "generalGraph", to = "anyGraph"): no edges are lost in the conversion to the most general class of graphs
coerce
signature(from = "multiGraph", to = "anyGraph"): no edges are lost in the conversion to the most general class of graphs
coerce
signature(from = "simpleGraph", to = "anyGraph"): no edges are lost in the conversion to the most general class of graphs
coerce
signature(from = "anyGraph", to = "dg.graph"): conversion to class 'dg.graph' of package 'dynamicGraph'
+
signature(e1 = "anyGraph", e2 = "vertexSet"): adds a vertex set to any graph by making the new vertices isolated
-
signature(e1 = "anyGraph", e2 = "vertexSet"): removes a vertex set from any graph by dropping all edges involving the vertex set
+
signature(e1 = "anyGraph", e2 = "edge"): adds an edge to any graph
-
signature(e1 = "anyGraph", e2 = "edge"): removes an edge from any graph
*
signature(e1 = "anyGraph", e2 = "vertexSet"): restricts any graph to a vertex set by dropping all edges involving vertices outside the vertex set

Note

Graphical representation via package 'dynamicGraph' is based on coercion to class dg.graph. Coercion to class dg.graph is implemented via coercion to class generalGraph. Graphical representation via package 'mathgraph' is obtained by means of coercion to class simpleGraph.

Author(s)

Jens Henrik Badsberg, Claus Dethlefsen, Luca La Rocca

See Also

incidenceList-class and incidenceList


[Package giRaph version 0.1-1 Index]