Skip to content

fix: remove dead test variables #511

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Becheler wants to merge 1 commit into
base: develop
Choose a base branch
from
+2 −18
Open

fix: remove dead test variables #511

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 0 additions & 12 deletions test/csr_graph_test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -321,18 +321,6 @@ template < typename OrigGraph > void graph_test(const OrigGraph& g)
{
BOOST_TEST(source(*oei, g2) == *vi);
}

// Find a vertex for testing
CSRGraphT::vertex_descriptor test_vertex
= vertex(num_vertices(g2) / 2, g2);
int edge_count = 0;
CSRGraphT::out_edge_iterator oei2, oei2_end;
for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end;
++oei2)
{
if (target(*oei2, g2) == test_vertex)
++edge_count;
}
}

// Run brandes_betweenness_centrality, which touches on a whole lot
Expand Down
5 changes: 1 addition & 4 deletions test/graph.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -156,7 +156,7 @@ template < class Graph > std::size_t count_edges(Graph& g)
int main(int, char*[])
{
int ret = 0;
std::size_t N = 5, E = 0;
std::size_t N = 5;
std::size_t old_N;

typedef ::Graph Graph;
Expand Down Expand Up @@ -218,7 +218,6 @@ int main(int, char*[])
ret = -1;
break;
}
++E;
}

// remove_edge(u, v, g)
Expand All @@ -235,7 +234,6 @@ int main(int, char*[])

Edge e = random_edge(g, gen);
boost::tie(a, b) = boost::incident(e, g);
--E;
#if VERBOSE
cerr << "remove_edge(" << vertex_id_map[a] << ","
<< vertex_id_map[b] << ")" << endl;
Expand Down Expand Up @@ -278,7 +276,6 @@ int main(int, char*[])
Vertex a, b;
Edge e = random_edge(g, gen);
boost::tie(a, b) = boost::incident(e, g);
--E;
#if VERBOSE
cerr << "remove_edge(" << vertex_id_map[a] << ","
<< vertex_id_map[b] << ")" << endl;
Expand Down
3 changes: 1 addition & 2 deletions test/property_iter.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -60,7 +60,7 @@ using std::find;
int main(int, char*[])
{
int ret = 0;
std::size_t N = 5, E = 0;
std::size_t N = 5;

typedef ::Graph Graph;
Graph g;
Expand Down Expand Up @@ -114,7 +114,6 @@ int main(int, char*[])
std::cout << "finished printing" << std::endl;
#endif
}
++E;
}

typedef boost::graph_property_iter_range< Graph, vertex_id_t >::iterator
Expand Down
Loading