shortest_hyperpaths: Find The Shortest Hyperpaths Between Two Vertices

In hwarden162/hyper: Work with Hypergraphs in R

Find The Shortest Hyperpaths Between Two Vertices

Description

A hyperpath is a set of hyperedges such that each consecutive pair of hyperedges contain at least vertex in common. A shortest hyperpath between two vertices is the smallest set of hyperedges that form a hyperpath such that one vertex is in the first hyperpath and the other vertex is in the last hyperpath.

Usage

shortest_hyperpaths(hype, from, to)

Arguments

hype	A hypergraph object.
from	The vertex that is the start of the hyperpath.
to	The vertex that is the end of the hyperpath,

Value

A list of shortest hyperpaths between the given vertices.

Examples

hype <- example_hype()
shortest_hyperpaths(hype, "v1", "v4")

hwarden162/hyper documentation built on Sept. 15, 2022, 5:21 a.m.