Detailed Description

How was this graph constructed? This info is useful for visualisation & debugging. And for constructing a topologoically sorted list of tasks. (see frechet::poly::AlgorithmTopoSort).

Definition at line 88 of file graph_m4ri.h.

#include <graph_m4ri.h>

Public Types
enum	{ PLACEMENT, RG, MERGE2, MERGE3 }

Public Attributes
enum frechet::reach::Graph::Origin:: { ... }	operation

int	blevel
	bottom-level (for topologial sorting; leaves = blevel 0 More...

int	succesors
	number of successors More...

int	i
	if this is a reachability graph: column range in free-space. this = RG(i,j), or CRG(i,j) More...

int	j


Graph::ptr	A
	if this graph was constructed as transitive closure: original graphs this = MERGE(A,B) More...

Graph::ptr	B


Graph::ptr	P
	valid placement applied to the graph More...

Member Enumeration Documentation

◆ anonymous enum

anonymous enum

Enumerator
PLACEMENT	this graph represents a set of valid placements
RG	this is a rechability graph, constructed from a reachability structure
MERGE2	this graph is the result of a MERGE operation (transitive closure) on two graphs
MERGE3	this graph is the result of a MERGE operation (transitive closure) on three graphs

Definition at line 90 of file graph_m4ri.h.

Member Data Documentation

◆ A

Graph::ptr frechet::reach::Graph::Origin::A

if this graph was constructed as transitive closure: original graphs this = MERGE(A,B)

Definition at line 106 of file graph_m4ri.h.

◆ B

Graph::ptr frechet::reach::Graph::Origin::B

Definition at line 106 of file graph_m4ri.h.

◆ blevel

int frechet::reach::Graph::Origin::blevel

bottom-level (for topologial sorting; leaves = blevel 0

Definition at line 97 of file graph_m4ri.h.

◆ i

int frechet::reach::Graph::Origin::i

if this is a reachability graph: column range in free-space. this = RG(i,j), or CRG(i,j)

Definition at line 102 of file graph_m4ri.h.

◆ j

int frechet::reach::Graph::Origin::j

Definition at line 102 of file graph_m4ri.h.

◆ operation

enum { ... } frechet::reach::Graph::Origin::operation

◆ P

Graph::ptr frechet::reach::Graph::Origin::P

valid placement applied to the graph

Definition at line 110 of file graph_m4ri.h.

◆ succesors

int frechet::reach::Graph::Origin::succesors

number of successors

Definition at line 99 of file graph_m4ri.h.

The documentation for this struct was generated from the following file:

include/frechet/reachability/graph_m4ri.h