preemtive push

Graphtheory/Basic_Graph.h

@@ -69,7 +69,7 @@ public:
   void conditional_bfs_all_components(std::function<void(Node<N,E>* from, Edge<N,E>* via, bool used_in_traversal)> edge_exec, std::function<bool(Edge<N,E>* via, Node<N,E>* node)> node_exec, std::deque<Node<N,E>*> starting_nodes = {}, bool all_paths = false, std::function<bool(Node<N,E>* from, Edge<N,E>* via)> guide = [](Node<N,E>* n, Edge<N,E>* e)->bool {return e->from() == n;});
 
   // _special_members_and_operators:
-  void operator=(Graph<N,E>& graph);
+  void operator=(const Graph<N,E>& graph);
   void operator=(Graph<N,E>&& graph);
 };
 

Graphtheory/Basic_Graph_special_members_and_operators.ipp

@@ -14,7 +14,7 @@ Graph<N,E>::Graph(Graph<N,E>&& graph)
 }
 
 template <typename N, typename E>
-void Graph<N,E>::operator=(Graph<N,E>& graph){
+void Graph<N,E>::operator=(const Graph<N,E>& graph){
   std::map<Node<N,E>*, Node<N,E>*> node_lookup;
 
   for(Node<N,E>* node : graph._nodes){

maintenance_problem_test.cpp

@@ -12,7 +12,7 @@ int main(){
       {{Flow, Attribute(max, 0)}, {Demand, Attribute(fix, 0)}, {Capacity, Attribute(fix, 1)}, {Critical, Attribute(fix, 0)}},
       {},
       4,
-      random_attribute_generator<CircSelectEdgeFields>({ {Capacity, {Integral, 0, 5}} }),
+      random_attribute_generator<CircSelectEdgeFields>({ {Capacity, {Integral, 1, 5}} }),
       4,
       random_attribute_generator<CircSelectNodeFields>({})
     ),