find_path

Finds a path between two nodes in a graph.
Different types of graphs use different algorithims to
find the paths. a <code>DirectedGraph</code> uses breadth-first search
while an <code>DirectedAcyclicGraph</code> uses topological sort.
The path is represented as a character vector with the
node ids of the nodes that make up the path.

Empower your data analysis with 'orbweaver', an R package
designed for effortless construction and analysis of graph data
structures. With 'orbweaver', you can seamlessly build and manipulate
graph structures, leveraging its high-performance methods for
filtering, joining, and mutating data within the R environment.
Drawing inspiration from the efficiency of the 'data.table'
package, 'orbweaver' ensures that mutations and changes to
the graph are performed in place, streamlining your
workflow for optimal productivity.

Andres Quintero

orbweaver

Fast and Efficient Graph Data Structures

ixpantia, SRL 

The authors of the dependency Rust crates 

find_path function

<dl><dt>graph</dt>
<dd>A graph object</dd>
<dt>from</dt>
<dd>The starting node of the path</dd>
<dt>to</dt>
<dd>The ending node of the path</dd></dl>

Arguments

Find a path between two nodes — find_path

<dl>

<dt>graph</dt>
<dd>A graph object</dd>


<dt>from</dt>
<dd>The starting node of the path</dd>


<dt>to</dt>
<dd>The ending node of the path</dd>

</dl>

find_path: Find a path between two nodes

Description

Usage

Value

Arguments