Utopia 2
Framework for studying models of complex & adaptive systems.
|
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/adjacency_matrix.hpp>
#include <boost/graph/subgraph.hpp>
#include <boost/graph/filtered_graph.hpp>
Go to the source code of this file.
Namespaces | |
namespace | Utopia |
namespace | Utopia::GraphUtils |
Enumerations | |
enum class | Utopia::IterateOver { Utopia::IterateOver::vertices , Utopia::IterateOver::edges , Utopia::IterateOver::neighbors , Utopia::IterateOver::inv_neighbors , Utopia::IterateOver::in_edges , Utopia::IterateOver::out_edges } |
Over which graph entity to iterate. More... | |
Functions | |
template<IterateOver iterate_over, typename Graph > | |
decltype(auto) | Utopia::GraphUtils::iterator_pair (const Graph &g) |
Get an iterator pair over selected graph entities. | |
template<IterateOver iterate_over, typename Graph , typename EntityDesc > | |
decltype(auto) | Utopia::GraphUtils::iterator_pair (EntityDesc e, const Graph &g) |
Get an iterator pair over selected graph entities. | |
template<IterateOver iterate_over, typename Graph > | |
decltype(auto) | Utopia::range (const Graph &g) |
Get the iterator range over selected graph entities. | |
template<IterateOver iterate_over, typename Graph , typename EntityDesc > | |
decltype(auto) | Utopia::range (EntityDesc e, const Graph &g) |
Get the iterator range over selected graph entities. | |