File: graph_from_graphdb.Rd

package info (click to toggle)
r-cran-igraph 1.0.1-1~bpo8%2B1
  • links: PTS, VCS
  • area: main
  • in suites: jessie-backports
  • size: 18,160 kB
  • sloc: ansic: 173,529; cpp: 19,365; fortran: 4,550; yacc: 1,164; tcl: 931; lex: 484; makefile: 149; sh: 9
file content (93 lines) | stat: -rw-r--r-- 3,586 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/foreign.R
\name{graph_from_graphdb}
\alias{graph.graphdb}
\alias{graph_from_graphdb}
\title{Load a graph from the graph database for testing graph isomorphism.}
\usage{
graph_from_graphdb(url = NULL, prefix = "iso", type = "r001",
  nodes = NULL, pair = "A", which = 0,
  base = "http://cneurocvs.rmki.kfki.hu/graphdb/gzip", compressed = TRUE,
  directed = TRUE)
}
\arguments{
\item{url}{If not \code{NULL} it is a complete URL with the file to import.}

\item{prefix}{Gives the prefix. See details below. Possible values:
\code{iso}, \code{i2}, \code{si4}, \code{si6}, \code{mcs10}, \code{mcs30},
\code{mcs50}, \code{mcs70}, \code{mcs90}.}

\item{type}{Gives the graph type identifier. See details below. Possible
values: \code{r001}, \code{r005}, \code{r01}, \code{r02}, \code{m2D},
\code{m2Dr2}, \code{m2Dr4}, \code{m2Dr6} \code{m3D}, \code{m3Dr2},
\code{m3Dr4}, \code{m3Dr6}, \code{m4D}, \code{m4Dr2}, \code{m4Dr4},
\code{m4Dr6}, \code{b03}, \code{b03m}, \code{b06}, \code{b06m}, \code{b09},
\code{b09m}.}

\item{nodes}{The number of vertices in the graph.}

\item{pair}{Specifies which graph of the pair to read. Possible values:
\code{A} and \code{B}.}

\item{which}{Gives the number of the graph to read. For every graph type
there are a number of actual graphs in the database. This argument specifies
which one to read.}

\item{base}{The base address of the database. See details below.}

\item{compressed}{Logical constant, if TRUE than the file is expected to be
compressed by gzip. If \code{url} is \code{NULL} then a \sQuote{\code{.gz}}
suffix is added to the filename.}

\item{directed}{Logical constant, whether to create a directed graph.}
}
\value{
A new graph object.
}
\description{
This function downloads a graph from a database created for the evaluation
of graph isomorphism testing algothitms.
}
\details{
\code{graph_from_graphdb} reads a graph from the graph database from an FTP or
HTTP server or from a local copy. It has two modes of operation:

If the \code{url} argument is specified then it should the complete path to
a local or remote graph database file. In this case we simply call
\code{\link{read_graph}} with the proper arguments to read the file.

If \code{url} is \code{NULL}, and this is the default, then the filename is
assembled from the \code{base}, \code{prefix}, \code{type}, \code{nodes},
\code{pair} and \code{which} arguments.

Unfortunately the original graph database homepage is now defunct, but see
its old version at
\url{http://web.archive.org/web/20090215182331/http://amalfi.dis.unina.it/graph/db/doc/graphdbat.html}
for the actual format of a graph database file and other information.
}
\examples{
\dontrun{
g <- graph_from_graphdb(prefix="iso", type="r001", nodes=20, pair="A",
  which=10, compressed=TRUE)
g2 <- graph_from_graphdb(prefix="iso", type="r001", nodes=20, pair="B",
  which=10, compressed=TRUE)
graph.isomorphic.vf2(g, g2)	\% should be TRUE
g3 <- graph_from_graphdb(url=paste(sep="/",
                              "http://cneurocvs.rmki.kfki.hu",
                              "graphdb/gzip/iso/bvg/b06m",
                              "iso_b06m_m200.A09.gz"))
}
}
\author{
Gabor Csardi \email{csardi.gabor@gmail.com}
}
\references{
M. De Santo, P. Foggia, C. Sansone, M. Vento: A large database
of graphs and its use for benchmarking graph isomorphism algorithms,
\emph{Pattern Recognition Letters}, Volume 24, Issue 8 (May 2003)
}
\seealso{
\code{\link{read_graph}}, \code{\link{graph.isomorphic.vf2}}
}
\keyword{graphs}