}
-int select_all_nodes()
+int select_all_nodes(Agraph_t * g)
{
int ind = 0;
//check if in the list
return 1;
}
-int select_all_edges()
+int select_all_edges(Agraph_t * g)
{
int ind = 0;
//check if in the list
}
-int deselect_all_nodes()
+int deselect_all_nodes(Agraph_t * g)
{
int ind = 0;
//check if in the list
}
-int deselect_all_edges()
+int deselect_all_edges(Agraph_t * g)
{
int ind = 0;
//check if in the list
}
int select_all(Agraph_t * g)
{
- select_all_nodes();
- select_all_edges();
+ select_all_nodes(g);
+ select_all_edges(g);
return 1;
}
int deselect_all(Agraph_t * g)
{
- deselect_all_nodes();
- deselect_all_edges();
+ deselect_all_nodes(g);
+ deselect_all_edges(g);
return 1;
}