Features
- Find shortest paths between nodes in a graph
- Find the common parents between selected nodes
- Directed Graph
- Directed Acyclic Graph
- It is quite fast
Why not igraph?
igraph is an amazing network analysis package. igraph is much more mature and orbweaver focuses on extreme performance and low latency operations. If you need super high performance and do not require weighted graphs, orbweaver may be for you.
We may add weighted graph in the future but for not it is not in the short-term road map.
Installation
Rust Toolchain
Before installing this package, you will need to install the Rust toolchain.
Mac or Linux
If you are on Mac or Linux, you can do this by running the following command in your terminal:
Windows
If you are on Windows, you can download the installer from here.
In order to compile this package manually, you will need the GNU ABI used by the GCC toolchain. This is not the default on Windows, so you will need to install the toolchain manually. You can do this by running the following command in your terminal:
If you are on Windows you may need to install Rtools as well. You can download the installer from here.
R Package
You can install orbweaver from CRAN with:
install.packages("orbweaver")You can install orbweaver from GitHub with:
# install.packages("remotes")
remotes::install_github("ixpantia/orbweaver-r")Example
library(orbweaver)
edges <- data.frame(
parent = c("A", "B", "C", "C", "F"),
child = c("B", "C", "D", "E", "D")
)
graph <- graph_builder() |>
populate_edges(edges, "parent", "child") |>
build_directed()
graph
#> # of nodes: 6
#> # of edges: 5
#> # of roots: 2
#> # of leaves: 2
#>
#> | Parent | Child |
#> | --------------- | --------------- |
#> | A | B |
#> | B | C |
#> | C | E |
#> | C | D |
#> | F | D |
graph |> find_all_paths(from = "A", to = "D")
#> [[1]]
#> # of nodes: 4
#> | Nodes |
#> | A |
#> | B |
#> | C |
#> | D |