graphs_transclos.h

Go to the documentation of this file.

 
#ifndef TRANSCLOS_H
#define TRANSCLOS_H
 
 /*   ____                 _             _                       _ _   _            */
 /*  / ___|_ __ __ _ _ __ | |__  ___ _  | |_ _ __ __ _ _ __  ___(_) |_(_)_   _____  */
 /* | |  _| '__/ _` | '_ \| '_ \/ __(_) | __| '__/ _` | '_ \/ __| | __| \ \ / / _ \ */
 /* | |_| | | | (_| | |_) | | | \__ \_  | |_| | | (_| | | | \__ \ | |_| |\ V /  __/ */
 /*  \____|_|  \__,_| .__/|_| |_|___(_)  \__|_|  \__,_|_| |_|___/_|\__|_| \_/ \___| */
 /*   ___| | ___  __|_|   _ _ __ ___                                                */
 /*  / __| |/ _ \/ __| | | | '__/ _ \                                               */
 /* | (__| | (_) \__ \ |_| | | |  __/_                                              */
 /*  \___|_|\___/|___/\__,_|_|  \___(_)                                             */
 
#include <stdbool.h>
#include "graphs.h"
#include "graphs_tarjan.h"
#include "type_binheap.h"
 
/***************************************************/
/* Functions restricted to directed acyclic graphs */
/***************************************************/

graph* compute_dag_of_sccs(graph*, 
    parti*                      
);

dequeue* topo_sort_dag(graph* 
);
 

dequeue* topo_sort_dag_start(graph*, 
    uint                          
);
 

graph* compute_tclos_dag(graph*, 
    dequeue*                  
);
 
/**********************************/
/* Functions for arbitrary graphs */
/**********************************/
 
 
 
 
// /**
//  * @brief
//  * Makes the transitive closure of the input graph.
//  */
// void make_tclos_graph(graph* //!< An arbitrary graph.
// );
 
#endif