graph.h File Reference

#include <boost/bimap.hpp>
#include <boost/functional/hash.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/graph/copy.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/dominator_tree.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/reverse_graph.hpp>
#include <boost/graph/strong_components.hpp>
#include <boost/graph/topological_sort.hpp>
#include <list>
#include <ranges>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>

Go to the source code of this file.

Classes
struct	sdfg::graph::DFSVisitor

Namespaces
namespace	sdfg
namespace	sdfg::graph

Typedefs
typedef boost::adjacency_list< boost::listS, boost::listS, boost::bidirectionalS >	sdfg::graph::Graph
typedef boost::graph_traits< Graph >::vertex_descriptor	sdfg::graph::Vertex
typedef boost::graph_traits< Graph >::edge_descriptor	sdfg::graph::Edge
typedef boost::adjacency_list< boost::listS, boost::listS, boost::undirectedS >	sdfg::graph::UndirectedGraph
typedef boost::graph_traits< UndirectedGraph >::edge_descriptor	sdfg::graph::UndirectedEdge
typedef boost::reverse_graph< Graph >	sdfg::graph::ReverseGraph
typedef boost::graph_traits< ReverseGraph >::edge_descriptor	sdfg::graph::ReverseEdge
typedef std::unordered_map< Vertex, size_t >	sdfg::graph::IndexMap

Functions
const ReverseGraph	sdfg::graph::reverse (const Graph &graph)
const std::tuple< std::unique_ptr< const UndirectedGraph >, const std::unordered_map< Vertex, Vertex >, const std::unordered_map< Vertex, Vertex > >	sdfg::graph::undirected (const Graph &graph)
const std::list< Vertex >	sdfg::graph::depth_first_search (const Graph &graph, const graph::Vertex start)
std::pair< int, std::unordered_map< Vertex, size_t > >	sdfg::graph::strongly_connected_components (const Graph &graph)
std::pair< size_t, const std::unordered_map< Vertex, size_t > >	sdfg::graph::weakly_connected_components (const Graph &graph)
const std::unordered_map< Vertex, Vertex >	sdfg::graph::dominator_tree (const Graph &graph, const Vertex src)
const std::unordered_map< Vertex, Vertex >	sdfg::graph::post_dominator_tree (Graph &graph)
const std::list< graph::Vertex >	sdfg::graph::topological_sort (const Graph &graph)
bool	sdfg::graph::is_acyclic (const Graph &graph)
const std::list< Edge >	sdfg::graph::back_edges (const Graph &graph, const graph::Vertex start)
void	sdfg::graph::all_simple_paths_dfs (const Graph &graph, const Edge edge, const Vertex v, std::list< std::list< Edge > > &all_paths, std::list< Edge > &current_path, std::set< Vertex > &visited)
const std::list< std::list< Edge > >	sdfg::graph::all_simple_paths (const Graph &graph, const Vertex src, const Vertex dst)