shortest_path.cpp File Reference

#include "graph_algorithm/algorithms/shortest_path.h"
#include "graph_algorithm/netlist_graph.h"
#include "hal_core/netlist/gate.h"

Include dependency graph for shortest_path.cpp:

Go to the source code of this file.

Namespaces
	hal
	hal::graph_algorithm

Functions
Result< std::vector< std::vector< u32 > > >	hal::graph_algorithm::get_shortest_paths (NetlistGraph *graph, Gate *from_gate, const std::vector< Gate * > &to_gates, NetlistGraph::Direction direction)
	Compute a shortest path from the specified from_gate to each of the given to_gates by traversing in the provided direction. More...
Result< std::vector< std::vector< u32 > > >	hal::graph_algorithm::get_shortest_paths (NetlistGraph *graph, u32 from_vertex, const std::vector< u32 > &to_vertices, NetlistGraph::Direction direction)
	Compute a shortest path from the specified from_vertex to each of the given to_vertices by traversing in the provided direction. More...
Result< std::vector< std::vector< u32 > > >	hal::graph_algorithm::get_shortest_paths_igraph (NetlistGraph *graph, u32 from_vertex, const igraph_vector_int_t *to_vertices, NetlistGraph::Direction direction)
	Compute a shortest path from the specified from_vertex to each of the given to_vertices by traversing in the provided direction. More...
Result< std::vector< std::vector< u32 > > >	hal::graph_algorithm::get_all_shortest_paths (NetlistGraph *graph, Gate *from_gate, const std::vector< Gate * > &to_gates, NetlistGraph::Direction direction)
	Compute shortest paths from the specified from_gate to each of the given to_gates by traversing in the provided direction. More...
Result< std::vector< std::vector< u32 > > >	hal::graph_algorithm::get_all_shortest_paths (NetlistGraph *graph, u32 from_vertex, const std::vector< u32 > &to_vertices, NetlistGraph::Direction direction)
	Compute shortest paths from the specified from_vertex to each of the given to_vertices by traversing in the provided direction. More...
Result< std::vector< std::vector< u32 > > >	hal::graph_algorithm::get_all_shortest_paths_igraph (NetlistGraph *graph, u32 from_vertex, const igraph_vector_int_t *to_vertices, NetlistGraph::Direction direction)
	Compute shortest paths from the specified from_vertex to each of the given to_vertices by traversing in the provided direction. Returns all shortest paths for each end gate. Each shortest path is given as a vector of vertices in the order of traversal. More...