Show / Hide Table of Contents

Class PathConstraintUtils

Contains utilities relating to ConnectedConstraint

Inheritance
object
PathConstraintUtils
Namespace: DeBroglie.Constraints
Assembly: DeBroglie.dll
Syntax
public static class PathConstraintUtils

Methods

| Edit this page View Source

CreateGraph(ITopology)

Declaration
public static PathConstraintUtils.SimpleGraph CreateGraph(ITopology topology)
Parameters
Type Name Description
ITopology topology
Returns
Type Description
PathConstraintUtils.SimpleGraph
| Edit this page View Source

GetArticulationPoints(SimpleGraph, bool[], bool[])

First, find the subgraph of graph given by just the walkable vertices. relevant defaults to walkable if null.

A cut-vertex is defined as any point that, if removed, there exist two other relevant points that no longer have a path.

For an explanation, see: https://www.boristhebrave.com/2018/04/28/random-paths-via-chiseling/

Declaration
public static PathConstraintUtils.AtrticulationPointsInfo GetArticulationPoints(PathConstraintUtils.SimpleGraph graph, bool[] walkable, bool[] relevant = null)
Parameters
Type Name Description
PathConstraintUtils.SimpleGraph graph
bool[] walkable
bool[] relevant
Returns
Type Description
PathConstraintUtils.AtrticulationPointsInfo
  • Edit this page
  • View Source
In this article
Back to top Generated by DocFX