topological_sort.h

Go to the documentation of this file.

/*
    This file is part of Ansel,
    Copyright (C) 2026 Aurélien PIERRE.
 
    Ansel is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.
 
    Ansel is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
 
    You should have received a copy of the GNU General Public License
    along with Ansel.  If not, see <http://www.gnu.org/licenses/>.
*/
 
#ifndef DT_MATH_TOPOLOGICAL_SORT_H
#define DT_MATH_TOPOLOGICAL_SORT_H
 
#include <glib.h>
 
G_BEGIN_DECLS
 
typedef struct dt_digraph_node_t dt_digraph_node_t;
 
typedef struct
{
  dt_digraph_node_t *previous; 
  dt_digraph_node_t *next;     
} dt_digraph_node_constraints_t;
 
struct dt_digraph_node_t
{
  const char *id;      
  char *tag;           
  GList *previous;     
  void *user_data;     
};
 
typedef void (*dt_node_user_data_destroy_t)(void *data);
 
int flatten_nodes(GList *input_nodes, GList **out_nodes);
 
int topological_sort(GList *nodes, GList **sorted, GList **cycle_out);
 
void dt_digraph_cleanup_full(
  GList *nodes,
  GHashTable *node_ht,
  dt_node_user_data_destroy_t user_destroy);
 
dt_digraph_node_t *dt_digraph_node_new(const char *id);
 
G_END_DECLS
 
#endif // DT_MATH_TOPOLOGICAL_SORT_H