diff options
| author | Jérémy Zurcher <jeremy@asynk.ch> | 2014-03-30 22:17:56 +0200 |
|---|---|---|
| committer | Jérémy Zurcher <jeremy@asynk.ch> | 2014-03-30 22:17:56 +0200 |
| commit | d44cd9ff53941d72c42c46d1fe73cc36c6969688 (patch) | |
| tree | b8e28f6d53856c3d45e226727f79a185b3d6207a /src/tests/eina_graph_suite.c | |
| parent | 19390ab685d27f2b2c3153dd53b5661998edcfaf (diff) | |
| download | eina_graph-d44cd9ff53941d72c42c46d1fe73cc36c6969688.zip eina_graph-d44cd9ff53941d72c42c46d1fe73cc36c6969688.tar.gz | |
some API function renamed
Diffstat (limited to 'src/tests/eina_graph_suite.c')
| -rw-r--r-- | src/tests/eina_graph_suite.c | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/src/tests/eina_graph_suite.c b/src/tests/eina_graph_suite.c index dd1d852..ff4822d 100644 --- a/src/tests/eina_graph_suite.c +++ b/src/tests/eina_graph_suite.c @@ -39,14 +39,14 @@ static void _bfs_tests(unsigned int vertices[], unsigned int n) _feed_graph(g); bfs = eina_graph_bfs_new(g, 0); - ck_assert(eina_graph_bfs_source(bfs) == 0); - ck_assert(eina_graph_bfs_has_path_to(bfs, 12) == EINA_FALSE); - ck_assert(eina_graph_bfs_path_to(bfs, 12) == NULL); - ck_assert(eina_graph_bfs_path_to(bfs, 15) == NULL); - ck_assert(eina_graph_bfs_dist_to(bfs, 15) == UINT_MAX); - ck_assert(eina_graph_bfs_has_path_to(bfs, 3) == EINA_TRUE); - ck_assert(eina_graph_bfs_dist_to(bfs, 3) == 2); - path = eina_graph_bfs_path_to(bfs, 3); + ck_assert(eina_graph_bfs_source_get(bfs) == 0); + ck_assert(eina_graph_bfs_path_exists(bfs, 12) == EINA_FALSE); + ck_assert(eina_graph_bfs_path_get(bfs, 12) == NULL); + ck_assert(eina_graph_bfs_path_get(bfs, 15) == NULL); + ck_assert(eina_graph_bfs_dist_get(bfs, 15) == UINT_MAX); + ck_assert(eina_graph_bfs_path_exists(bfs, 3) == EINA_TRUE); + ck_assert(eina_graph_bfs_dist_get(bfs, 3) == 2); + path = eina_graph_bfs_path_get(bfs, 3); ck_assert(path != NULL); ck_assert(eina_list_count(path) == n); i = 0; @@ -58,7 +58,7 @@ static void _bfs_tests(unsigned int vertices[], unsigned int n) path = NULL; eina_graph_bfs_free(bfs); - path = eina_graph_bfs_shortest_path(g, 0, 3); + path = eina_graph_bfs_shortest_path_get(g, 0, 3); ck_assert(path != NULL); ck_assert(eina_list_count(path) == n); i = 0; @@ -96,12 +96,12 @@ static void _dfs_tests(Eina_Bool r, unsigned int vertices[], unsigned int n) _feed_graph(g); dfs = eina_graph_dfs_new(g, 0, r); - ck_assert(eina_graph_dfs_source(dfs) == 0); - ck_assert(eina_graph_dfs_has_path_to(dfs, 12) == EINA_FALSE); - ck_assert(eina_graph_dfs_path_to(dfs, 12) == NULL); - ck_assert(eina_graph_dfs_path_to(dfs, 15) == NULL); - ck_assert(eina_graph_dfs_has_path_to(dfs, 3) == EINA_TRUE); - path = eina_graph_dfs_path_to(dfs, 3); + ck_assert(eina_graph_dfs_source_get(dfs) == 0); + ck_assert(eina_graph_dfs_path_exists(dfs, 12) == EINA_FALSE); + ck_assert(eina_graph_dfs_path_get(dfs, 12) == NULL); + ck_assert(eina_graph_dfs_path_get(dfs, 15) == NULL); + ck_assert(eina_graph_dfs_path_exists(dfs, 3) == EINA_TRUE); + path = eina_graph_dfs_path_get(dfs, 3); ck_assert(path != NULL); ck_assert(eina_list_count(path) == n); i = 0; |