dgraphs: Data-Derived Graph Construction Utilities

Construct and analyze graphs derived from numerical observations.

Start here

• Finding your way around dgraphs: a task-oriented catalog of public functions and object methods.

• Synthetic geometry and point sampling: reproducible curves, surfaces, embeddings and graph examples.

• Constructing and Diagnosing Data-Derived Graphs: graph-family comparisons, connectivity repair and diagnostics.

These links open installed HTML guides. From the console, use vignette("function-guide", package = "dgraphs") or vignette("synthetic-geometry", package = "dgraphs").

See also

create.graph(), create.sknn.graph(), create.rknn.graph(), graph.geodesic.distances(), create.path.graph(), plot.dgraph(), sample.synthetic.geometry()

Author

Maintainer: Pawel Gajer pgajer@gmail.com

Authors:

• Pawel Gajer pgajer@gmail.com

Other contributors:

• Sunil Arya (ANN library) [contributor]

• David M. Mount (ANN library) [contributor]

• University of Maryland (ANN library) [copyright holder]

• Yixuan Qiu (Spectra library) [contributor, copyright holder]

• Anna Araslanova (Spectra LOBPCG solver) [contributor, copyright holder]

• Gael Guennebaud (Spectra linear algebra routines) [contributor, copyright holder]

• Jitse Niesen (Spectra linear algebra routines) [contributor, copyright holder]

• Netherlands eScience Center (Spectra eigensolver routines) [contributor, copyright holder]

• Danil Kirsanov (Polyhedral geodesic library) [contributor, copyright holder]

Examples

graph <- create.graph("chain", n = 5)
print(graph)
#> Undirected graph: 5 vertices, 4 edges
#> Stored stages: final 
graph.geodesic.distances(graph, vertices = c(1, 5))
#>      [,1] [,2]
#> [1,]    0    4
#> [2,]    4    0
# The endpoint distance is four unit-length edges.