{ "_id": "6abe69e499f7aa8c6aa56636", "Package": "dgraphs", "Title": "Data-Derived Graph Construction Utilities", "Version": "0.3.0.9000", "Authors@R": "c(\nperson(\"Pawel\", \"Gajer\", role = c(\"aut\", \"cre\"),\nemail = \"pgajer@gmail.com\"),\nperson(\"Sunil\", \"Arya\", role = \"ctb\",\ncomment = \"ANN library\"),\nperson(\"David M.\", \"Mount\", role = \"ctb\",\ncomment = \"ANN library\"),\nperson(\"University of Maryland\", role = \"cph\",\ncomment = \"ANN library\"),\nperson(\"Yixuan\", \"Qiu\", role = c(\"ctb\", \"cph\"),\ncomment = \"Spectra library\"),\nperson(\"Anna\", \"Araslanova\", role = c(\"ctb\", \"cph\"),\ncomment = \"Spectra LOBPCG solver\"),\nperson(\"Gael\", \"Guennebaud\", role = c(\"ctb\", \"cph\"),\ncomment = \"Spectra linear algebra routines\"),\nperson(\"Jitse\", \"Niesen\", role = c(\"ctb\", \"cph\"),\ncomment = \"Spectra linear algebra routines\"),\nperson(\"Netherlands eScience Center\", role = c(\"ctb\", \"cph\"),\ncomment = \"Spectra eigensolver routines\"),\nperson(\"Danil\", \"Kirsanov\", role = c(\"ctb\", \"cph\"),\ncomment = \"Polyhedral geodesic library\")\n)", "Description": "Constructs data-derived graphs from numerical observations\nusing mutual, shared-neighbor, intersection, geodesic, radius,\nadaptive-radius, minimum-spanning-tree completion, and optional\niterated adaptive neighborhood methods. Provides graph\nconversion, pruning, diagnostics, spectral embedding, endpoint\ndetection, and path utilities, with reproducible synthetic\ngeometries and point sampling for graph and embedding\nexperiments. The implemented graph constructions include\nmethods described by Jarvis and Patrick (1973)\n, Brito et al. (1997)\n, Berry and Sauer (2019)\n, and Gower and Ross (1969)\n.", "License": "MIT + file LICENSE", "Copyright": "file inst/COPYRIGHTS", "URL": "https://pgajer.github.io/dgraphs/,\nhttps://github.com/pgajer/dgraphs", "BugReports": "https://github.com/pgajer/dgraphs/issues", "Encoding": "UTF-8", "Language": "en-US", "Roxygen": "list(markdown = TRUE)", "SystemRequirements": "C++17", "VignetteBuilder": "knitr", "Config/testthat/edition": "3", "Config/roxygen2/version": "8.0.0", "Config/pak/sysreqs": "cmake libglpk-dev libxml2-dev", "Repository": "https://pgajer.r-universe.dev", "Date/Publication": "2026-10-01 10:54:45 UTC", "RemoteUrl": "https://github.com/pgajer/dgraphs", "RemoteRef": "HEAD", "RemoteSha": "9c17cbea5c553c858076a2e13422fe6987feea12", "NeedsCompilation": "yes", "Packaged": { "Date": "2026-10-01 13:42:24 UTC", "User": "root" }, "Author": "Pawel Gajer [aut, cre],\nSunil Arya [ctb] (ANN library),\nDavid M. Mount [ctb] (ANN library),\nUniversity of Maryland [cph] (ANN library),\nYixuan Qiu [ctb, cph] (Spectra library),\nAnna Araslanova [ctb, cph] (Spectra LOBPCG solver),\nGael Guennebaud [ctb, cph] (Spectra linear algebra routines),\nJitse Niesen [ctb, cph] (Spectra linear algebra routines),\nNetherlands eScience Center [ctb, cph] (Spectra eigensolver routines),\nDanil Kirsanov [ctb, cph] (Polyhedral geodesic library)", "Maintainer": "Pawel Gajer ", "_user": "pgajer", "_type": "src", "_file": "dgraphs_0.3.0.9000.tar.gz", "_fileid": "https://r2.ropensci.org/9f63308ce73a7ca5390b87876e2817cdafaa1690cad0799fae0e76dadc75627e", "_filesize": 3113201, "_sha256": "9f63308ce73a7ca5390b87876e2817cdafaa1690cad0799fae0e76dadc75627e", "_expires": "2027-01-09T14:10:42.000Z", "_created": "2026-10-01T13:42:24.000Z", "_published": "2026-10-01T14:10:44.719Z", "_jobs": [ { "job": 110398047389, "time": 299, "config": "linux-devel-arm64", "r": "4.7.0", "check": "OK", "artifact": "11166519759" }, { "job": 110398047320, "time": 326, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "11167455761" }, { "job": 110398047376, "time": 280, "config": "linux-release-arm64", "r": "4.6.1", "check": "OK", "artifact": "11166399687" }, { "job": 110398047577, "time": 319, "config": "linux-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "11166324748" }, { "job": 110398047800, "time": 395, "config": "macos-oldrel-arm64", "r": "4.5.3", "check": "NOTE", "artifact": "11168556617" }, { "job": 110398047554, "time": 565, "config": "macos-oldrel-x86_64", "r": "4.5.3", "check": "NOTE", "artifact": "11168223082" }, { "job": 110398047516, "time": 403, "config": "macos-release-arm64", "r": "4.6.1", "check": "OK", "artifact": "11168207602" }, { "job": 110398047629, "time": 669, "config": "macos-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "11168353517" }, { "job": 110394705196, "time": 467, "config": "source", "r": "4.6.1", "check": "OK", "artifact": "11164864807" }, { "job": 110398047430, "time": 270, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "11166419579" }, { "job": 110398047553, "time": 439, "config": "windows-devel-arm64", "r": "4.7.0", "check": "OK", "artifact": "11167206361" }, { "job": 110398047547, "time": 506, "config": "windows-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "11168020381" }, { "job": 110398047576, "time": 374, "config": "windows-oldrel-x86_64", "r": "4.5.3", "check": "NOTE", "artifact": "11167685114" }, { "job": 110398047471, "time": 470, "config": "windows-release-arm64", "r": "4.6.1", "check": "OK", "artifact": "11167785409" }, { "job": 110398047478, "time": 424, "config": "windows-release-x86_64", "r": "4.6.1", "check": "OK", "artifact": "11167800145" } ], "_host": "GitHub-Actions", "_buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777", "_status": "success", "_upstream": "https://github.com/pgajer/dgraphs", "_commit": { "id": "9c17cbea5c553c858076a2e13422fe6987feea12", "author": "pgajer ", "committer": "pgajer ", "message": "Explain density and curvature follow-up in Fermat vignette\n", "time": 1790852085 }, "_maintainer": { "name": "Pawel Gajer", "email": "pgajer@gmail.com", "login": "pgajer", "description": "", "uuid": 321355 }, "_distro": "resolute", "_registered": true, "_dependencies": [ { "package": "R", "version": ">= 4.1.0", "role": "Depends" }, { "package": "BH", "role": "LinkingTo" }, { "package": "nloptr", "role": "LinkingTo" }, { "package": "Rcpp", "role": "LinkingTo" }, { "package": "RcppEigen", "role": "LinkingTo" }, { "package": "FNN", "role": "Imports" }, { "package": "igraph", "version": ">= 2.2.0", "role": "Imports" }, { "package": "nloptr", "role": "Imports" }, { "package": "parallel", "role": "Imports" }, { "package": "stats", "role": "Imports" }, { "package": "Rcpp", "role": "Imports" }, { "package": "shiny", "role": "Suggests" }, { "package": "bslib", "role": "Suggests" }, { "package": "plotly", "role": "Suggests" }, { "package": "grip", "role": "Suggests" }, { "package": "digest", "role": "Suggests" }, { "package": "geometry", "role": "Suggests" }, { "package": "htmltools", "role": "Suggests" }, { "package": "htmlwidgets", "role": "Suggests" }, { "package": "ivue", "version": ">= 0.1.0", "role": "Suggests" }, { "package": "knitr", "role": "Suggests" }, { "package": "Matrix", "role": "Suggests" }, { "package": "rmarkdown", "role": "Suggests" }, { "package": "rgl", "role": "Suggests" }, { "package": "testthat", "version": ">= 3.0.0", "role": "Suggests" }, { "package": "withr", "role": "Suggests" } ], "_owner": "pgajer", "_selfowned": true, "_usedby": 1, "_updates": [ { "week": "2026-23", "n": 11 }, { "week": "2026-24", "n": 11 }, { "week": "2026-25", "n": 2 }, { "week": "2026-27", "n": 1 }, { "week": "2026-28", "n": 1 }, { "week": "2026-30", "n": 9 }, { "week": "2026-31", "n": 2 }, { "week": "2026-32", "n": 3 }, { "week": "2026-34", "n": 7 }, { "week": "2026-35", "n": 2 }, { "week": "2026-36", "n": 7 }, { "week": "2026-37", "n": 11 }, { "week": "2026-38", "n": 13 }, { "week": "2026-39", "n": 5 }, { "week": "2026-40", "n": 13 } ], "_tags": [ { "name": "v0.2.0", "date": "2026-08-27" } ], "_stars": 1, "_contributors": [ { "user": "pgajer", "count": 379, "uuid": 321355 } ], "_userbio": { "uuid": 321355, "type": "user", "name": "Pawel", "followers": 3 }, "_downloads": { "count": 375, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/dgraphs" }, "_devurl": "https://github.com/pgajer/dgraphs", "_pkgdown": "https://pgajer.github.io/dgraphs/", "_searchresults": 49, "_topics": [ "cpp" ], "_rbuild": "4.6.1", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/dgraphs.html", "extra/manual.pdf", "extra/NEWS.html", "extra/NEWS.txt", "extra/readme.html", "extra/readme.md", "LICENSE" ], "_homeurl": "https://github.com/pgajer/dgraphs", "_realowner": "pgajer", "_cranurl": true, "_releases": [ { "version": "0.1.0", "date": "2026-08-20" }, { "version": "0.2.0", "date": "2026-09-08" } ], "_exports": [ "as_igraph", "build.ian.backend", "build.iknn.graphs.and.selectk", "compare.adj.lists", "compare.paths", "compute.geodesic.stats", "compute.graph.diameter", "compute.graph.distance", "compute.graph.endpoint.scores", "compute.graph.summary.pmf", "compute.graph.summary.stability", "compute.stability.metrics", "compute.vertex.geodesic.stats", "convert.adjacency.list.to.adjacency.matrix", "convert.adjacency.to.edge.matrix", "convert.to.undirected", "convert.weighted.adjacency.matrix.to.adjacency.list", "count.edges", "create.cknn.graph", "create.cmst.graph", "create.fermat.sknn.graph", "create.geodesic.iknn.graph", "create.graph", "create.grid.graph", "create.ian.graph", "create.iknn.graphs", "create.iterated.iknn.graphs", "create.maximal.packing", "create.mknn.graph", "create.mknn.graphs", "create.path.graph", "create.plm.graph", "create.rknn.graph", "create.rknn.graphs", "create.single.iknn.graph", "create.sknn.graph", "create.sknn.graphs", "create.subgraph", "create.threshold.distance.graph", "detect.graph.endpoints", "detect.local.extrema", "dgraph", "edge.diff", "edge.lengths.synthetic.geometry", "embed.quadform.surface", "embed.synthetic.geometry", "explore.graphs", "extract.trajectory.edge.lengths", "fermat.distances", "fermat.knn", "geodesic.core.endpoints", "geodesic.disk", "geodesic.knn", "geodesic.knnx", "get.shortest.path", "graph.adjacency", "graph.connected.components", "graph.edge.attribute", "graph.edges", "graph.embedding", "graph.geodesic.distances", "graph.lengths", "graph.order", "graph.spectral.embedding", "graph.spectrum", "graph.stages", "graph.summary.divergence", "identical.vertex.set.weighted.graph.similarity", "isometry.distance.correlations", "isometry.distortion.quantiles", "isometry.geodesic.diagnostics", "isometry.rel.abs.error", "isometry.rel.rms.error", "isometry.scale", "jensen.shannon.divergence", "join.graphs", "minh.limit", "nerve.graph", "path.dist", "path.length", "quadform.gradient", "quadform.metric", "read.graph.benchmark", "register.graph.project", "remove.knn.outliers", "rm.self.loops", "sample.synthetic.geometry", "subdivide.path", "summarize.isometry.deviation", "synthetic.circle", "synthetic.helix", "synthetic.point.line.junction", "synthetic.quadform", "synthetic.sampling.clustered", "synthetic.sampling.dirichlet.zeros", "synthetic.sampling.gapped.uniform", "synthetic.sampling.grid.interval", "synthetic.sampling.quadform.lab", "synthetic.sampling.truncated.normal", "synthetic.sampling.uniform.box", "synthetic.sampling.uniform.disk", "synthetic.sampling.uniform.interval", "synthetic.sampling.uniform.rectangle", "synthetic.simplex", "synthetic.sphere.cap", "synthetic.stratified", "synthetic.stratum.point", "synthetic.stratum.rectangle", "synthetic.stratum.segment", "synthetic.torus.patch", "synthetic.trefoil", "validate.maximal.packing", "validate.synthetic.geometry", "validate.synthetic.sampling", "verify.maximal.packing", "vertices", "wgraph.prune.long.edges" ], "_help": [ { "page": "dgraphs-package", "title": "dgraphs: Data-Derived Graph Construction Utilities", "topics": [ "dgraphs-package", "dgraphs" ] }, { "page": "as_igraph", "title": "Convert a dgraph to igraph", "topics": [ "as_igraph" ] }, { "page": "build.ian.backend", "title": "Build the Optional IAN Backend", "topics": [ "build.ian.backend" ] }, { "page": "build.iknn.graphs.and.selectk", "title": "Build iKNN Graphs and Select a Neighborhood Size", "topics": [ "build.iknn.graphs.and.selectk" ] }, { "page": "compare.adj.lists", "title": "Compare Two Adjacency Lists", "topics": [ "compare.adj.lists" ] }, { "page": "compare.paths", "title": "Compare Paths Across Hop Limits", "topics": [ "compare.paths" ] }, { "page": "compute.geodesic.stats", "title": "Compute Geodesic Statistics for Grid Vertices", "topics": [ "compute.geodesic.stats" ] }, { "page": "compute.graph.diameter", "title": "Compute a Weighted Graph Diameter", "topics": [ "compute.graph.diameter" ] }, { "page": "compute.graph.distance", "title": "Compute a Weighted Shortest-Path Distance", "topics": [ "compute.graph.distance" ] }, { "page": "compute.graph.endpoint.scores", "title": "Compute Graph Endpoint Scores from a 3D Embedding", "topics": [ "compute.graph.endpoint.scores" ] }, { "page": "compute.graph.summary.pmf", "title": "Compute a graph summary as a probability mass function", "topics": [ "compute.graph.summary.pmf" ] }, { "page": "compute.graph.summary.stability", "title": "Compute graph-summary stability across a graph sequence", "topics": [ "compute.graph.summary.stability" ] }, { "page": "compute.stability.metrics", "title": "Compute Stability Metrics Across a Sequence of IkNN Graphs", "topics": [ "compute.stability.metrics" ] }, { "page": "compute.vertex.geodesic.stats", "title": "Compute Geodesic Statistics for a Single Grid Vertex", "topics": [ "compute.vertex.geodesic.stats" ] }, { "page": "convert.adjacency.list.to.adjacency.matrix", "title": "Convert an Adjacency List to an Adjacency Matrix", "topics": [ "convert.adjacency.list.to.adjacency.matrix" ] }, { "page": "convert.adjacency.to.edge.matrix", "title": "Convert an Adjacency List to an Edge Matrix", "topics": [ "convert.adjacency.to.edge.matrix" ] }, { "page": "convert.to.undirected", "title": "Convert a Directed Adjacency List to an Undirected Adjacency List", "topics": [ "convert.to.undirected" ] }, { "page": "convert.weighted.adjacency.matrix.to.adjacency.list", "title": "Convert a Weighted Adjacency Matrix to Lists", "topics": [ "convert.weighted.adjacency.matrix.to.adjacency.list" ] }, { "page": "count.edges", "title": "Count Edges in an Undirected Adjacency List", "topics": [ "count.edges" ] }, { "page": "create.cknn.graph", "title": "Compute a Continuous-kNN Graph", "topics": [ "create.cknn.graph" ] }, { "page": "create.cmst.graph", "title": "Construct a Minimal Spanning Tree (MST) Completion Graph", "topics": [ "create.cmst.graph" ] }, { "page": "create.geodesic.iknn.graph", "title": "Create a graph-geodesic iKNN graph", "topics": [ "create.geodesic.iknn.graph" ] }, { "page": "create.graph", "title": "Create a Standard Graph", "topics": [ "create.graph" ] }, { "page": "create.grid.graph", "title": "Create a Refined Graph with Approximately Uniform Edge Spacing", "topics": [ "create.grid.graph" ] }, { "page": "create.ian.graph", "title": "Construct an Iterated Adaptive Neighborhood Graph", "topics": [ "create.ian.graph" ] }, { "page": "create.iknn.graphs", "title": "Create intersection k-nearest neighbor graphs with dual pruning", "topics": [ "create.iknn.graphs" ] }, { "page": "create.iterated.iknn.graphs", "title": "Create iterated graph-geodesic iKNN graphs", "topics": [ "create.iterated.iknn.graphs" ] }, { "page": "create.maximal.packing", "title": "Create a Maximal Packing of Vertices in a Graph", "topics": [ "create.maximal.packing" ] }, { "page": "create.mknn.graph", "title": "Compute a Mutual k-Nearest Neighbor Graph with Weights", "topics": [ "create.mknn.graph" ] }, { "page": "create.mknn.graphs", "title": "Create Multiple Mutual kNN Graphs with Geometric Pruning", "topics": [ "create.mknn.graphs" ] }, { "page": "create.path.graph", "title": "Construct Path Graphs Across Hop Limits", "topics": [ "create.path.graph" ] }, { "page": "create.plm.graph", "title": "Create a Path Length Matrix Graph Structure", "topics": [ "create.plm.graph" ] }, { "page": "create.rknn.graph", "title": "Compute a Radius-kNN Graph", "topics": [ "create.rknn.graph" ] }, { "page": "create.rknn.graphs", "title": "Compute Adaptive Radius-kNN Graphs Across k Values", "topics": [ "create.rknn.graphs" ] }, { "page": "create.single.iknn.graph", "title": "Create a Single Intersection-weighted k-Nearest Neighbors Graph", "topics": [ "create.single.iknn.graph" ] }, { "page": "create.sknn.graph", "title": "Compute a Symmetric k-Nearest Neighbor Graph", "topics": [ "create.sknn.graph" ] }, { "page": "create.sknn.graphs", "title": "Compute a Series of Symmetric k-Nearest Neighbor Graphs", "topics": [ "create.sknn.graphs" ] }, { "page": "create.subgraph", "title": "Extract an Induced Subgraph", "topics": [ "create.subgraph" ] }, { "page": "create.threshold.distance.graph", "title": "Create a Threshold Distance Graph", "topics": [ "create.threshold.distance.graph" ] }, { "page": "detect.graph.endpoints", "title": "Detect Graph Endpoints from a 3D Embedding", "topics": [ "detect.graph.endpoints" ] }, { "page": "detect.local.extrema", "title": "Detect Local Extrema in a Graph", "topics": [ "detect.local.extrema" ] }, { "page": "dgraph", "title": "Construct and Inspect an Undirected Metric Graph", "topics": [ "dgraph", "graph.adjacency", "graph.edge.attribute", "graph.edges", "graph.lengths", "graph.order", "graph.stages" ] }, { "page": "edge.diff", "title": "Compute Edge Difference Between Two Graphs", "topics": [ "edge.diff" ] }, { "page": "edge.lengths.synthetic.geometry", "title": "Exact latent-segment lengths under a synthetic geometry", "topics": [ "edge.lengths.synthetic.geometry" ] }, { "page": "embed.quadform.surface", "title": "Lift coordinates onto a quadratic surface using Geometry Lab arithmetic", "topics": [ "embed.quadform.surface" ] }, { "page": "embed.synthetic.geometry", "title": "Embed latent coordinates through a synthetic geometry", "topics": [ "embed.synthetic.geometry" ] }, { "page": "explore.graphs", "title": "Open the Graph Reconstruction Explorer", "topics": [ "explore.graphs" ] }, { "page": "extract.trajectory.edge.lengths", "title": "Extract Edge Lengths Along a Graph Path", "topics": [ "extract.trajectory.edge.lengths" ] }, { "page": "fermat.distances", "title": "Compute Complete or Graph-Restricted Sample Fermat Distances", "topics": [ "fermat.distances" ] }, { "page": "fermat.knn", "title": "Find Exact Sample Fermat Nearest Neighbors", "topics": [ "create.fermat.sknn.graph", "fermat.knn" ] }, { "page": "geodesic.core.endpoints", "title": "Select Graph Endpoints by Core-Eccentricity Geometry", "topics": [ "geodesic.core.endpoints" ] }, { "page": "geodesic.disk", "title": "Geodesic Disk in a Weighted Graph", "topics": [ "geodesic.disk" ] }, { "page": "geodesic.knn", "title": "Find Geodesic Neighbors Within a Point Cloud", "topics": [ "geodesic.knn" ] }, { "page": "geodesic.knnx", "title": "Find Geodesic Neighbors from Grid Queries to Observations", "topics": [ "geodesic.knnx" ] }, { "page": "get.shortest.path", "title": "Get Shortest Path Between Two Vertices", "topics": [ "get.shortest.path" ] }, { "page": "graph.connected.components", "title": "Assign Vertices to Connected Components", "topics": [ "graph.connected.components" ] }, { "page": "graph.embedding", "title": "Embed Graph in 2D or 3D Space", "topics": [ "graph.embedding" ] }, { "page": "graph.geodesic.distances", "title": "Compute Graph Geodesic Distances", "topics": [ "graph.geodesic.distances" ] }, { "page": "graph.spectral.embedding", "title": "Embed a Connected Graph Using its Positive Laplacian Spectrum", "topics": [ "graph.spectral.embedding" ] }, { "page": "graph.spectrum", "title": "Compute the Positive Spectrum of an Unweighted Graph Laplacian", "topics": [ "graph.spectrum" ] }, { "page": "graph.summary.divergence", "title": "Compute divergence between two graphs using a selected graph summary", "topics": [ "graph.summary.divergence" ] }, { "page": "identical.vertex.set.weighted.graph.similarity", "title": "Weighted Graph Distance Between Graphs with Identical Vertex Sets", "topics": [ "identical.vertex.set.weighted.graph.similarity" ] }, { "page": "inspect.path.graph", "title": "Inspect a Path Graph", "topics": [ "inspect.path.graph", "print.path.graph", "summary.path.graph" ] }, { "page": "inspect.path.graph.series", "title": "Inspect a Collection of Hop-Constrained Path Graphs", "topics": [ "inspect.path.graph.series", "print.path.graph.series", "summary.path.graph.series" ] }, { "page": "inspect.synthetic_geometry_sample", "title": "Inspect a Synthetic Geometry Sample", "topics": [ "inspect.synthetic_geometry_sample", "print.summary.synthetic_geometry_sample", "print.synthetic_geometry_sample", "summary.synthetic_geometry_sample" ] }, { "page": "isometry.distance.correlations", "title": "Compute Distance Preservation Correlations", "topics": [ "isometry.distance.correlations" ] }, { "page": "isometry.distortion.quantiles", "title": "Compute Multiplicative Distortion Quantiles", "topics": [ "isometry.distortion.quantiles" ] }, { "page": "isometry.geodesic.diagnostics", "title": "Compute Geodesic-Isometry Diagnostics", "topics": [ "isometry.geodesic.diagnostics" ] }, { "page": "isometry.rel.abs.error", "title": "Compute Relative Absolute Isometry Errors", "topics": [ "isometry.rel.abs.error" ] }, { "page": "isometry.rel.rms.error", "title": "Compute Relative RMS Isometry Error", "topics": [ "isometry.rel.rms.error" ] }, { "page": "isometry.scale", "title": "Compute the Optimal Isometry Calibration Scale", "topics": [ "isometry.scale" ] }, { "page": "jensen.shannon.divergence", "title": "Jensen-Shannon Divergence", "topics": [ "jensen.shannon.divergence" ] }, { "page": "join.graphs", "title": "Join Two Adjacency-List Graphs", "topics": [ "join.graphs" ] }, { "page": "minh.limit", "title": "Find the Minimum Hop Limit for Path Existence", "topics": [ "minh.limit" ] }, { "page": "nerve.graph", "title": "Construct the Nerve Graph of a Cover", "topics": [ "nerve.graph" ] }, { "page": "overlap.distribution.plot", "title": "Plot the distribution of overlap values", "topics": [ "overlap.distribution.plot" ] }, { "page": "path.dist", "title": "Normalized Cumulative Distance Along a Vertex Path", "topics": [ "path.dist" ] }, { "page": "path.length", "title": "Compute Euclidean Path Length", "topics": [ "path.length" ] }, { "page": "plot.build_iknn_graphs_and_selectk", "title": "Plot method for build_iknn_graphs_and_selectk", "topics": [ "plot.build_iknn_graphs_and_selectk" ] }, { "page": "plot.cst_graph_mixing_stats", "title": "Plot method for cst_graph_mixing_stats", "topics": [ "plot.cst_graph_mixing_stats" ] }, { "page": "plot.dgraph", "title": "Plot a dgraph with Reusable Coordinates", "topics": [ "plot.dgraph" ] }, { "page": "plot.geodesic_stats", "title": "Plot Geodesic Statistics", "topics": [ "plot.geodesic_stats" ] }, { "page": "plot.iknn_stability_metrics", "title": "Plot Method for IkNN Stability Metrics", "topics": [ "plot.iknn_stability_metrics" ] }, { "page": "plot.IkNNgraphs", "title": "Plot Diagnostics for Intersection k-NN Graph Analysis", "topics": [ "plot.IkNNgraphs" ] }, { "page": "plot.vertex_geodesic_stats", "title": "Plot method for vertex_geodesic_stats objects", "topics": [ "plot.vertex_geodesic_stats" ] }, { "page": "print.build_iknn_graphs_and_selectk", "title": "Print method for build_iknn_graphs_and_selectk", "topics": [ "print.build_iknn_graphs_and_selectk" ] }, { "page": "print.dgraph", "title": "Print an Undirected Graph", "topics": [ "print.dgraph" ] }, { "page": "print.geodesic_stats", "title": "Print method for geodesic_stats objects", "topics": [ "print.geodesic_stats" ] }, { "page": "print.graph.constructors", "title": "Print Graph Constructor Results", "topics": [ "print.adaptive_radius_graph", "print.cknn_graph", "print.graph.constructors", "print.radius_graph", "print.rknn_graphs", "print.sknn_graph", "print.sknn_graphs" ] }, { "page": "print.knn.outliers", "title": "Print Method for knn.outliers Objects", "topics": [ "print.knn.outliers" ] }, { "page": "print.maximal_packing", "title": "Print Method for Maximal Packing Results", "topics": [ "print.maximal_packing" ] }, { "page": "print.mknn_graph", "title": "Print Method for mknn_graph Objects", "topics": [ "print.mknn_graph" ] }, { "page": "print.mknn_graphs", "title": "Print Method for mknn_graphs Objects", "topics": [ "print.mknn_graphs" ] }, { "page": "print.mst_completion_graph", "title": "Print Method for MST Completion Graph Objects", "topics": [ "print.mst_completion_graph" ] }, { "page": "print.packing_validation", "title": "Print Method for Packing Validation Results", "topics": [ "print.packing_validation" ] }, { "page": "print.path.graph.plm", "title": "Print a Path-Length-Metric Graph", "topics": [ "print.path.graph.plm" ] }, { "page": "print.summary.knn.outliers", "title": "Print Method for summary.knn.outliers Objects", "topics": [ "print.summary.knn.outliers" ] }, { "page": "print.summary.mst_completion_graph", "title": "Print Summary of MST Completion Graph", "topics": [ "print.summary.mst_completion_graph" ] }, { "page": "quadform.gradient", "title": "Evaluate gradients of all quadforms", "topics": [ "quadform.gradient" ] }, { "page": "quadform.metric", "title": "Evaluate the induced metric of a quadform geometry", "topics": [ "quadform.metric" ] }, { "page": "read.graph.benchmark", "title": "Read a Saved Graph Reconstruction Benchmark", "topics": [ "read.graph.benchmark" ] }, { "page": "register.graph.project", "title": "Remember a Graph Explorer Project", "topics": [ "register.graph.project" ] }, { "page": "remove.knn.outliers", "title": "Remove Outliers from a State Space Using k-Nearest Neighbors", "topics": [ "remove.knn.outliers" ] }, { "page": "rm.self.loops", "title": "Remove Self-Loops from an Adjacency List", "topics": [ "rm.self.loops" ] }, { "page": "sample.synthetic.geometry", "title": "Realize points on a synthetic geometry with explicit random-state control", "topics": [ "sample.synthetic.geometry" ] }, { "page": "subdivide.path", "title": "Subdivide a Path into Arc-Length Spaced Points", "topics": [ "subdivide.path" ] }, { "page": "summarize.isometry.deviation", "title": "Summarize Deviation from Isometry", "topics": [ "summarize.isometry.deviation" ] }, { "page": "summary.geodesic_stats", "title": "Summary method for geodesic_stats objects", "topics": [ "summary.geodesic_stats" ] }, { "page": "summary.IkNN", "title": "Summarize IkNN Graph Object", "topics": [ "summary.IkNN" ] }, { "page": "summary.iknn_graphs", "title": "Summarize an iknn_graphs Object", "topics": [ "summary.iknn_graphs" ] }, { "page": "summary.iterated_iknn_graphs", "title": "Summarize Iterated Intersection k-NN Graphs", "topics": [ "summary.iterated_iknn_graphs" ] }, { "page": "summary.knn.outliers", "title": "Summary Method for knn.outliers Objects", "topics": [ "summary.knn.outliers" ] }, { "page": "summary.local_extrema", "title": "Summarize Local Extrema", "topics": [ "print.summary.local_extrema", "summary.local_extrema" ] }, { "page": "summary.mknn_graphs", "title": "Summary Method for mknn_graphs Objects", "topics": [ "summary.mknn_graphs" ] }, { "page": "summary.mst_completion_graph", "title": "Summary Method for MST Completion Graph Objects", "topics": [ "summary.mst_completion_graph" ] }, { "page": "summary.rknn_graphs", "title": "Summarize an rknn_graphs Object", "topics": [ "summary.rknn_graphs" ] }, { "page": "summary.vertex_geodesic_stats", "title": "Summary method for vertex_geodesic_stats objects", "topics": [ "summary.vertex_geodesic_stats" ] }, { "page": "synthetic.circle", "title": "Specify a circle geometry", "topics": [ "synthetic.circle" ] }, { "page": "synthetic.helix", "title": "Specify a helix geometry", "topics": [ "synthetic.helix" ] }, { "page": "synthetic.point.line.junction", "title": "Specify a point-line junction", "topics": [ "synthetic.point.line.junction" ] }, { "page": "synthetic.quadform", "title": "Specify a quadform geometry", "topics": [ "synthetic.quadform" ] }, { "page": "synthetic.sampling.clustered", "title": "Clustered sampling specification", "topics": [ "synthetic.sampling.clustered" ] }, { "page": "synthetic.sampling.dirichlet.zeros", "title": "Dirichlet sampling with structural zeros", "topics": [ "synthetic.sampling.dirichlet.zeros" ] }, { "page": "synthetic.sampling.gapped.uniform", "title": "Gapped-uniform sampling specification", "topics": [ "synthetic.sampling.gapped.uniform" ] }, { "page": "synthetic.sampling.grid.interval", "title": "Deterministic interval-grid sampling specification", "topics": [ "synthetic.sampling.grid.interval" ] }, { "page": "synthetic.sampling.quadform.lab", "title": "Versioned quadratic-surface sampling used by Geometry Lab", "topics": [ "synthetic.sampling.quadform.lab" ] }, { "page": "synthetic.sampling.truncated.normal", "title": "Truncated-normal sampling specification", "topics": [ "synthetic.sampling.truncated.normal" ] }, { "page": "synthetic.sampling.uniform.box", "title": "Uniform-box sampling specification", "topics": [ "synthetic.sampling.uniform.box" ] }, { "page": "synthetic.sampling.uniform.disk", "title": "Uniform-disk sampling specification", "topics": [ "synthetic.sampling.uniform.disk" ] }, { "page": "synthetic.sampling.uniform.interval", "title": "Uniform-interval sampling specification", "topics": [ "synthetic.sampling.uniform.interval" ] }, { "page": "synthetic.sampling.uniform.rectangle", "title": "Uniform-rectangle sampling specification", "topics": [ "synthetic.sampling.uniform.rectangle" ] }, { "page": "synthetic.simplex", "title": "Specify a simplex geometry", "topics": [ "synthetic.simplex" ] }, { "page": "synthetic.sphere.cap", "title": "Specify a sphere-cap geometry", "topics": [ "synthetic.sphere.cap" ] }, { "page": "synthetic.stratified", "title": "Assemble a stratified geometry", "topics": [ "synthetic.stratified" ] }, { "page": "synthetic.stratum.point", "title": "Specify a point stratum", "topics": [ "synthetic.stratum.point" ] }, { "page": "synthetic.stratum.rectangle", "title": "Specify a rectangle stratum", "topics": [ "synthetic.stratum.rectangle" ] }, { "page": "synthetic.stratum.segment", "title": "Specify a line-segment stratum", "topics": [ "synthetic.stratum.segment" ] }, { "page": "synthetic.torus.patch", "title": "Specify a torus-patch geometry", "topics": [ "synthetic.torus.patch" ] }, { "page": "synthetic.trefoil", "title": "Specify a trefoil-knot geometry", "topics": [ "synthetic.trefoil" ] }, { "page": "validate.maximal.packing", "title": "Validate a Maximal Packing", "topics": [ "validate.maximal.packing" ] }, { "page": "validate.synthetic.geometry", "title": "Validate a geometry specification or its latent coordinates", "topics": [ "validate.synthetic.geometry" ] }, { "page": "validate.synthetic.sampling", "title": "Validate a point-sampling specification and geometric support", "topics": [ "validate.synthetic.sampling" ] }, { "page": "verify.maximal.packing", "title": "Verify Maximal Packing Created by create.maximal.packing", "topics": [ "verify.maximal.packing" ] }, { "page": "vertices", "title": "Extract Vertices from a Graph Result", "topics": [ "vertices" ] }, { "page": "vertices.local_extrema", "title": "Extract a Local-Extremum Neighborhood", "topics": [ "vertices.local_extrema" ] }, { "page": "wgraph.prune.long.edges", "title": "Prune Long Edges in a Weighted Graph", "topics": [ "wgraph.prune.long.edges" ] } ], "_readme": "https://github.com/pgajer/dgraphs/raw/HEAD/README.md", "_rundeps": [ "BH", "cli", "cpp11", "FNN", "glue", "igraph", "lattice", "lifecycle", "magrittr", "Matrix", "nloptr", "pkgconfig", "Rcpp", "RcppEigen", "rlang", "vctrs" ], "_sysdeps": [ { "shlib": "libstdc++", "package": "libstdc++6", "source": "gcc", "version": "16-20260322-1ubuntu1", "name": "c++", "homepage": "http://gcc.gnu.org/", "description": "GNU Standard C++ Library v3" } ], "_vignettes": [ { "source": "data-derived-graph-workflow.Rmd", "filename": "data-derived-graph-workflow.html", "title": "Constructing and Diagnosing Data-Derived Graphs", "engine": "knitr::rmarkdown", "headings": [ "Overview", "Construct candidate graph families", "Inspect a parameter sequence", "Convert and inspect a selected graph", "Diagnose geodesic fidelity", "Practical guidance" ], "created": "2026-08-21 01:51:05", "modified": "2026-09-14 20:23:34", "commits": 2 }, { "source": "fermat-distances.Rmd", "filename": "fermat-distances.html", "title": "Density-sensitive paths with Fermat distances", "engine": "knitr::rmarkdown", "headings": [ "The estimator and its graph restriction", "Noisy circles with different sampling densities", "Does a sparse graph give the same distances?", "Two noisy arms with diffuse background points", "How much does the first seed conceal?", "Complete-graph distances without storing the graph", "Sparse metric MDS with consistent Fermat targets", "What the theory does and does not establish", "Exact nearest neighbors without all-pairs distances", "References" ], "created": "2026-09-30 22:33:55", "modified": "2026-10-01 01:21:52", "commits": 5 }, { "source": "fermat-surfaces.Rmd", "filename": "fermat-surfaces.html", "title": "Fermat distances and their supporting graphs on surfaces", "engine": "knitr::rmarkdown", "headings": [ "Generate the observations", "Distances and the path graph", "Compare with surface geodesics", "Inspect supporting edges in three dimensions", "Chord lengths before and after scaling", "Paraboloid reference-method comparison", "Follow-up: sampling density, intermediate powers and stronger curvature" ], "created": "2026-10-01 08:37:21", "modified": "2026-10-01 10:54:45", "commits": 5 }, { "source": "function-guide.Rmd", "filename": "function-guide.html", "title": "Finding your way around dgraphs", "engine": "knitr::rmarkdown", "headings": [ "Choose a starting point", "A first graph", "Constructing a standard graph", "Conventions that affect your choice", "A common graph object", "Neighborhood sizes and edge quantities", "Connectivity, stages and cost", "Distances and stored routes", "Positive spectra and spectral coordinates", "Plotting a graph and reusing its layout", "Reuse an expensive computation", "Function catalog", "Graph construction and parameter sequences", "Basic graphs and representation", "Connectivity and graph editing", "Paths and distances", "Edge lengths and pruning", "Diagnostics, endpoints and packing", "Spectral methods and graph display", "Synthetic geometry and embedding", "Point sampling", "Interactive graph reconstruction explorer", "Object workflows and method help", "Finding more help", "Detailed help for this build" ], "created": "2026-09-14 20:23:34", "modified": "2026-10-01 01:21:52", "commits": 11 }, { "source": "ian-graphs.Rmd", "filename": "ian-graphs.html", "title": "IAN graphs: setup and interpreting results", "engine": "knitr::rmarkdown", "headings": [ "Build the optional backend once", "Construct and inspect a graph", "Numerical behavior and incomplete results", "Resources and qualification" ], "created": "2026-09-24 02:25:04", "modified": "2026-09-24 02:25:04", "commits": 1 }, { "source": "synthetic-geometry.Rmd", "filename": "synthetic-geometry.html", "title": "Synthetic geometry and point sampling", "engine": "knitr::rmarkdown", "headings": [ "A curve: angles, coordinates and a graph", "A quadratic surface: parameter sampling and embedding", "Chords, lifted segments and shortest paths", "Random frames and single points", "Explore quadratic geometry in 3D", "Shape: flat, bowl, dome, cylinder, saddle and mixed terms", "Sampling: domain, density, gaps and ordering", "Placement: canonical, supplied and random frames, with offsets", "Dimensions: a curve, multiple heights, a 3D latent domain and one point", "Differential geometry: gradient, metric and area element", "Inspect the graph and a lifted latent segment", "A simplex with a lower-dimensional face", "Choosing compatible sampling specifications", "Reproducibility and continuation", "Opting into the current R stream", "Next steps" ], "created": "2026-09-14 20:23:34", "modified": "2026-09-15 22:52:35", "commits": 3 } ], "_score": 6.8205298485235195, "_indexed": true, "_nocasepkg": "dgraphs", "_universes": [ "pgajer" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "0.3.0.9000", "date": "2026-10-01T13:46:26.000Z", "distro": "resolute", "arch": "aarch64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/647cdcc835e418771da349d1308fa2bf983034b9922f71be57b996dc1a74978c", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.7.0", "os": "linux", "version": "0.3.0.9000", "date": "2026-10-01T13:46:42.000Z", "distro": "resolute", "arch": "x86_64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/bc86355219f97f3a57f3cc8d7ace8894eb4f836729c9cac4c0f584e7544621b4", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.6.1", "os": "linux", "version": "0.3.0.9000", "date": "2026-10-01T13:46:19.000Z", "distro": "resolute", "arch": "aarch64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/410822c03e999b15d74027a291df0c8e76dac6e6d766a328be253a2707955f72", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.6.1", "os": "linux", "version": "0.3.0.9000", "date": "2026-10-01T13:46:40.000Z", "distro": "resolute", "arch": "x86_64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/f8f42a0122665631edb61d4d3bf2dd77d37232fe78bf754c6bdb37dd2b6c1e14", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.5.3", "os": "mac", "version": "0.3.0.9000", "date": "2026-10-01T14:05:23.000Z", "arch": "aarch64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/657d11c2b50099f1722f12fb2e68ab966d06e4d31e064c6b11ff9a0a12bcc99c", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.5.3", "os": "mac", "version": "0.3.0.9000", "date": "2026-10-01T14:00:35.000Z", "arch": "x86_64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/7e754d213e869c00427f83c96b710500f3c0467224e3447ddd28cdce6f4f7e4f", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.6.1", "os": "mac", "version": "0.3.0.9000", "date": "2026-10-01T14:02:50.000Z", "arch": "aarch64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/675ed57aec5a827956e46058f5a00997aaefe4e3de7e75fe9133663fe00d0bd8", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.6.1", "os": "mac", "version": "0.3.0.9000", "date": "2026-10-01T14:03:00.000Z", "arch": "x86_64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/6ee1c109689626ed9330b5e8609ebd451750725b16b31eb34df022b738976af3", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.6.0", "os": "wasm", "version": "0.3.0.9000", "date": "2026-10-01T13:46:41.000Z", "arch": "emscripten", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/1a6c96234cc317b84977abd50173922fcd32b58a4c4e578d252efa47f37a6d7f", "status": "success", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.7.0", "os": "win", "version": "0.3.0.9000", "date": "2026-10-01T13:47:18.000Z", "arch": "aarch64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/4061318cc1327d2bfd4b463006489076a096bb5a9ad2b5f81dbdf91bce86c765", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.7.0", "os": "win", "version": "0.3.0.9000", "date": "2026-10-01T13:46:33.000Z", "arch": "x86_64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/4e76d668d1e5b0093fb6df4d1442b011773cc992c9aac54050823b7e1dcafec2", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.5.3", "os": "win", "version": "0.3.0.9000", "date": "2026-10-01T13:45:37.000Z", "arch": "x86_64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/bcd68897769c8d61de22c2de4422028945bf4d4300a9378461efb286a0c81a6f", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.6.1", "os": "win", "version": "0.3.0.9000", "date": "2026-10-01T13:47:54.000Z", "arch": "aarch64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/ca0569398a4bf7fe66beaadb949f661485a706c0fc92b1deeb0705ebc43b1875", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" }, { "r": "4.6.1", "os": "win", "version": "0.3.0.9000", "date": "2026-10-01T13:45:38.000Z", "arch": "x86_64", "commit": "9c17cbea5c553c858076a2e13422fe6987feea12", "fileid": "https://r2.ropensci.org/3339375d47a8d214451ac5ed6d85c1097b55a802eaafcae593272307c630d3d6", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/pgajer/actions/runs/36869874777" } ] }