GraphLibrary  0.0.1
A simple library that implements various graph algorithms.
 All Classes Namespaces Files Functions Variables Typedefs Macros
gl::Graph< SCALAR, STORAGE_KIND, DIRECTION > Member List

This is the complete list of members for gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >, including all inherited members.

BFS_queue_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
checkRange(const idx_t &idx1) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
checkRange(const idx_t &idx1, const idx_t &idx2) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
ConstEdgeIterator typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
ConstNodeIterator typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
construct()gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inlineprivate
delEdge(const idx_t &start, const idx_t &end)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
dest_vec_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
DFS_queue_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
Edge typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
edge_begin()gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
edge_cbegin() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
edge_cend() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
edge_end()gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
EdgeIterator typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
edges_gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >protected
getEdgeColor(const idx_t &src, const idx_t &dest) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getEdgeWeight(const idx_t &start, const idx_t &end) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getGraphLabel() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNeighbours(const idx_t &node) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNeighbourWeights(const idx_t &node) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNodeCapacity(const idx_t &id) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNodeColor(const idx_t &id) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNodeDegree(const idx_t &id) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNodeInDegree(const idx_t &id) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNodeLabel(const idx_t &id) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNodeOutDegree(const idx_t &id) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getNodePosition(const idx_t &id) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getUnvisitedNeighbours(const idx_t &node, const std::vector< bool > &visited) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
getUnvisitedNeighbourWeights(const idx_t &node, const visit_list_t &visited) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
Graph(const idx_t &numNodes=0, const std::string &label="Graph")gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
Graph(const std::string &degreeSeq, const std::string &label="Simple Undirected Graph")gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
Graph(const Property &property)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
hasCycle() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
hasEdge(const idx_t &start, const idx_t &end) const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
idx_list_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
idx_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
isDirected() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
isUndirected() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
matrix_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
Node typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
node_begin()gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
node_cbegin() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
node_cend() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
node_end()gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
NodeIterator typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
nodeList_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
nodes_gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >protected
numEdges() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
numNodes() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
operator!=(const Graph< SCALAR, STORAGE_KIND, DIRECTION > &rhs)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
operator==(const Graph< SCALAR, gl::Matrix, DIRECTION > &rhs)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
ordered_list_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
property_gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >protected
readPositionsFromFile(const std::string &inFile)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
rootList_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
setEdge(const idx_t &start, const idx_t &end, const val_t &weight=1, const Color &color=Color())gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
setEdge(const Edge &edge)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
setEdgesFromListFile(const std::string &inFile)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
setEdgesFromMatrixFile(const std::string &inFile)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
setGraphLabel(const std::string &label)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
toList() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
toMatrix() const gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
updateEdge(const idx_t &start, const idx_t &end, const val_t &weight, const gl::Color &color)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
updateNode(const idx_t &id, const std::string &label, const val_t &capacity, const gl::Color &color, const std::pair< float, float > &position)gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline
val_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
visit_list_t typedefgl::Graph< SCALAR, STORAGE_KIND, DIRECTION >
~Graph()gl::Graph< SCALAR, STORAGE_KIND, DIRECTION >inline