dt_digraph_node_t Struct Reference

Directed graph node. More...

#include <topological_sort.h>

Collaboration diagram for dt_digraph_node_t:

Data Fields
const char *	id
char *	tag
GList *	previous
void *	user_data

Detailed Description

Directed graph node.

Nodes are identified by id and carry:

• a list of predecessor nodes (previous)
• an opaque payload pointer (user_data)

Semantics:

• Each element of node->previous is a dt_digraph_node_t* that MUST come before the owner node. This encodes a directed edge: previous -> self.

When produced by flatten_nodes(), id is owned (g_strdup()) and must be freed.

Field Documentation

id

const char* dt_digraph_node_t::id

Node identifier (owned for canonical nodes created by flatten).

Referenced by _hm_build_input_nodes_from_ids_filtered(), _hm_topo_resolve_incompatible_constraints(), dt_digraph_node_free_full(), flatten_nodes(), and topological_sort().

previous

GList* dt_digraph_node_t::previous

GList of dt_digraph_node_t* (each element is a predecessor node).

Referenced by _hm_build_raster_mask_nodes_from_modules(), _iop_rules(), dt_digraph_node_free_full(), flatten_nodes(), and topological_sort().

tag

char* dt_digraph_node_t::tag

Optional label for debugging/provenance (owned; may be NULL).

Referenced by _hm_build_raster_mask_nodes_from_modules(), _iop_rules(), dt_digraph_node_free_full(), and flatten_nodes().

user_data

void* dt_digraph_node_t::user_data

Arbitrary payload (ownership defined by caller; may be freed via callback).

Referenced by dt_digraph_node_free_full(), and flatten_nodes().

---

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

• topological_sort.h