dt_digraph_node_constraints_t Struct Reference

One constraint set relative to the node that owns it. More...

#include <topological_sort.h>

Collaboration diagram for dt_digraph_node_constraints_t:

Data Fields
dt_digraph_node_t *	previous
dt_digraph_node_t *	next

Detailed Description

One constraint set relative to the node that owns it.

Each instance encodes up to two ordering relations involving the owning node ("self"):

• If previous is non-NULL: previous must come before self.
• If next is non-NULL: self must come before next.

Either pointer may be NULL (meaning "no constraint of this kind" for that set). The obvious thing to consider here is that previous/next doesn't imply immediately adjacent, otherwise that would be a linked list.

Note

The pointers stored here are non-owning references. The constraint object does not own previous or next.

Field Documentation

next

dt_digraph_node_t* dt_digraph_node_constraints_t::next

Node that must follow the owner node (edge self->next).

previous

dt_digraph_node_t* dt_digraph_node_constraints_t::previous

Node that must precede the owner node (edge previous->self).

---

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

• topological_sort.h