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/lib/eina_graph_bfs.h | |
| parent | 19390ab685d27f2b2c3153dd53b5661998edcfaf (diff) | |
| download | eina_graph-d44cd9ff53941d72c42c46d1fe73cc36c6969688.zip eina_graph-d44cd9ff53941d72c42c46d1fe73cc36c6969688.tar.gz | |
some API function renamed
Diffstat (limited to 'src/lib/eina_graph_bfs.h')
| -rw-r--r-- | src/lib/eina_graph_bfs.h | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/lib/eina_graph_bfs.h b/src/lib/eina_graph_bfs.h index f367cf4..21e5336 100644 --- a/src/lib/eina_graph_bfs.h +++ b/src/lib/eina_graph_bfs.h @@ -49,7 +49,7 @@ typedef struct _Eina_Graph_BFS_Opaque Eina_Graph_BFS; * NULL if v is not reachable. */ EAPI Eina_List * -eina_graph_bfs_shortest_path(Eina_Graph *g, unsigned int s, unsigned int d); +eina_graph_bfs_shortest_path_get(Eina_Graph *g, unsigned int s, unsigned int d); /** * returns a Breadth First Search of the given graph. @@ -78,7 +78,7 @@ eina_graph_bfs_free(Eina_Graph_BFS *bfs); * @return the source vertex of the BFS. */ EAPI unsigned int -eina_graph_bfs_source(Eina_Graph_BFS *bfs); +eina_graph_bfs_source_get(Eina_Graph_BFS *bfs); /** * is there a path from the source to the given vertex. @@ -89,7 +89,7 @@ eina_graph_bfs_source(Eina_Graph_BFS *bfs); * @return EINA_TRUE if the vertex is reachable from the source. */ EAPI Eina_Bool -eina_graph_bfs_has_path_to(Eina_Graph_BFS *bfs, unsigned int v); +eina_graph_bfs_path_exists(Eina_Graph_BFS *bfs, unsigned int v); /* * return the path to reach the given vertex from the source. @@ -103,7 +103,7 @@ eina_graph_bfs_has_path_to(Eina_Graph_BFS *bfs, unsigned int v); * NULL if v is not reachable. */ EAPI Eina_List * -eina_graph_bfs_path_to(Eina_Graph_BFS *bfs, unsigned int v); +eina_graph_bfs_path_get(Eina_Graph_BFS *bfs, unsigned int v); /* * return the distance from the source to the given vertex. @@ -115,6 +115,6 @@ eina_graph_bfs_path_to(Eina_Graph_BFS *bfs, unsigned int v); * UINT_MAX in not reachable. */ EAPI unsigned int -eina_graph_bfs_dist_to(Eina_Graph_BFS *bfs, unsigned int v); +eina_graph_bfs_dist_get(Eina_Graph_BFS *bfs, unsigned int v); #endif /* _EINA_GRAPH_BFS_H */ |