| multiGraph-class {giRaph} | R Documentation |
A class for multi-graphs.
Objects can be created by calls of the form new("multiGraph", ...).
A multiGraph object consists of three slots, one for each possible representation:
adjacencyList, incidenceMatrix and incidenceList.
adjacencyList:"adjacencyList"incidenceMatrix:"incidenceMatrix"incidenceList:"incidenceList"
Class "generalGraph", directly, with explicit coerce.
Class "anyGraph", directly, with explicit coerce.
signature(.Object="multiGraph"):
constructs a multi-graph from one of the three possible representationssignature(object = "multiGraph"): displays the available representations of a multi-graphsignature(x = "multiGraph"): static graphical representation via package 'mathgraph'signature(object = "multiGraph"):
dynamic graphical representation via package 'dynamicGraph'signature(x = "multiGraph"): sets the incidence list representationsignature(x = "multiGraph"): sets the incidence matrix representationsignature(x = "multiGraph"): sets the adjacency list representationsignature(object = "multiGraph"): gets the adjacency list representationsignature(x = "multiGraph"): gets the character vertex identifiers of a multi-graphsignature(x = "multiGraph"): sets the character vertex identifiers of a multi-graphsignature(object = "multiGraph"):
returns the number of vertices and the total number of edge occurrences in a multi-graphsignature(object = "multiGraph"):
a graph object is empty if all its possible representations are emptysignature(el = "edge", ou = "multiGraph"):
an edge occurs in a graph object if it occurs in its non-empty slotssignature(x = "multiGraph", y = "multiGraph"):
x and y are the same if their non-empty slots represent the same graphsignature(x = "multiGraph"): extracts an induced subgraphsignature(x = "multiGraph"): extracts the character identifier of a vertexsignature(from = "anyGraph", to = "multiGraph"):
all but ordinary directed and undirected edges are lost in the conversionsignature(from = "generalGraph", to = "multiGraph"):
hyper-edges are lost in the conversionsignature(from = "simpleGraph", to = "multiGraph"):
no edges are lost in the conversion as every simple-graph is a multi-graphsignature(from = "multiGraph", to = "dg.simple.graph"):
conversion to class 'dg.simple.graph' of package 'dynamicGraph'signature(from = "multiGraph", to = "dg.graph"):
conversion to class 'dg.graph' of package 'dynamicGraph'signature(e1 = "multiGraph", e2 = "vertexSet"):
adds a vertex set to a multi-graph by making the new vertices isolatedsignature(e1 = "multiGraph", e2 = "vertexSet"):
removes a vertex set from a multi-graph by dropping all edges involving the vertex setsignature(e1 = "multiGraph", e2 = "edge"):
adds an edge to a multi-graphsignature(e1 = "multiGraph", e2 = "edge"):
removes an edge from a multi-graphsignature(e1 = "multiGraph", e2 = "vertexSet"):
restricts a multi-graph to a vertex set by dropping all edges involving vertices outside the vertex set
Graphical representation via package 'dynamicGraph' is based on coercion to class dg.graph,
implemented via coercion to class dg.simple.graph. Coercion to class dg.simple.graph is
implemented via coercion to class simpleGraph, thus dropping loops and parallel edges. Graphical
representation via package 'mathgraph' is obtained by means of coercion to class simpleGraph.
Jens Henrik Badsberg, Claus Dethlefsen, Luca La Rocca
adjacencyList-class and adjacencyList