Optimise Flow Algorithm/Datastructures in use

include/util/static_graph.hpp

@@ -63,9 +63,9 @@ template <typename EdgeDataT> class SortableEdgeWithData
 
 template <typename NodeT, typename EdgeT, bool UseSharedMemory = false> class FlexibleStaticGraph
 {
-    static_assert(traits::HasFirstEdgeMember<NodeT>(),
+    static_assert(traits::HasFirstEdgeMember<NodeT>::value,
                   "Model for compatible Node type requires .first_edge member attribute");
-    static_assert(traits::HasDataAndTargetMember<EdgeT>(),
+    static_assert(traits::HasDataAndTargetMember<EdgeT>::value,
                   "Model for compatible Edge type requires .data and .target member attribute");
 
   public:

include/util/static_graph_traits.hpp

@@ -34,7 +34,7 @@ struct HasTargetMember<T, decltype((void)(sizeof(std::declval<T>().target) > 0))
 // Static Graph requires edges to have a .target and .data member attribute
 template <typename Edge>
 struct HasDataAndTargetMember
-    : std::integral_constant<bool, HasDataMember<Edge>() && HasTargetMember<Edge>()>
+    : std::integral_constant<bool, HasDataMember<Edge>::value && HasTargetMember<Edge>::value>
 {
 };