#include <atlas.h>
Public Member Functions | |
CAtlas (int dimension, bool directed) | |
virtual | ~CAtlas () |
int | GetDimension (int *dimension) |
int | AddVertex (AT_scalar *conf, int *vID, void *userDef=NULL) |
int | RemoveVertex (int vID) |
int | GetVertexConfiguration (int vID, AT_scalar *conf, void **userDef=NULL) |
int | GetNrVertices (int *nr) |
int | GetVertices (int *vIDs) |
int | SetUserDef (int vID, void *userDef) |
int | AddEdge (int vID0, int vID1, AT_scalar value, void *userDef=NULL) |
int | RemoveEdge (int vID0, int vID1) |
int | GetNrPredecessors (int vID, int *nr) |
int | GetNrSuccessors (int vID, int *nr) |
int | GetSuccessor (int vID, int nr, int *nID) |
int | GetPredecessor (int vID, int nr, int *nID) |
int | GetPredecessors (int vID, int *ids) |
int | GetSuccessors (int vID, int *ids) |
int | SetEdgeConfiguration (int vID0, int vID1, AT_scalar value, void *userDef=NULL) |
int | GetEdgeConfiguration (int vID0, int vID1, AT_scalar *value, void **userDef=NULL) |
int | SetEdgeInvalidation (int vID0, int vID1, bool invalidate) |
int | FindShortestPaths (int startID) |
int | FindAllPairsShortestPaths () |
int | AStar (int startID, int goalID, AT_AstarHeuristicCallbackType ASHCB, int *size, void *userDef=NULL) |
int | GetAStarQueryVertex (int nr, int *vID) |
int | Query (int goalID, int *size, AT_scalar *length=NULL) |
int | Query (int startID, int goalID, int *size, AT_scalar *length=NULL) |
int | GetQueryVertex (int nr, int *vID) |
int | VerticesConnected (int vID0, int vID1, bool *connected) |
int | ResetGraph () |
int | LoadGraph (char *fileName) |
int | SaveGraph (char *fileName) |
int | CheckUsefulCycle (int startID, int goalID, AT_scalar K, AT_CalculateDistanceCallbackType calcDistCB, bool *result, void *userDef=NULL) |