addNode(std::unique_ptr< NodeConcept< Id, Size > > node) | dsm::Graph< Id, Size > | |
addNode(const Node< Id, Size > &node) | dsm::Graph< Id, Size > | |
addNodes(Tn &&... nodes) (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | |
addNodes(T1 &&node, Tn &&... nodes) (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | |
addStreet(std::shared_ptr< Street< Id, Size > > street) | dsm::Graph< Id, Size > | |
addStreet(const Street< Id, Size > &street) | dsm::Graph< Id, Size > | |
addStreets(T1 &&street) (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | |
addStreets(T1 &&street, Tn &&... streets) (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | |
adjMatrix() const | dsm::Graph< Id, Size > | inline |
buildAdj() | dsm::Graph< Id, Size > | |
buildStreetAngles() | dsm::Graph< Id, Size > | |
exportMatrix(std::string path="./matrix.dsm", bool isAdj=true) | dsm::Graph< Id, Size > | |
Graph() (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | |
Graph(const SparseMatrix< Id, bool > &adj) | dsm::Graph< Id, Size > | |
Graph(const std::unordered_map< Id, std::unique_ptr< Street< Id, Size > > > &streetSet) | dsm::Graph< Id, Size > | |
Graph(const Graph< Id, Size > &other) (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | inline |
Graph(Graph< Id, Size > &&)=default (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | |
importCoordinates(const std::string &fileName) | dsm::Graph< Id, Size > | |
importMatrix(const std::string &fileName, bool isAdj=true) | dsm::Graph< Id, Size > | |
importOSMEdges(const std::string &fileName) | dsm::Graph< Id, Size > | |
importOSMNodes(const std::string &fileName) | dsm::Graph< Id, Size > | |
makeRoundabout(Id nodeId) | dsm::Graph< Id, Size > | |
makeSpireStreet(Id streetId) | dsm::Graph< Id, Size > | |
makeTrafficLight(Id nodeId) | dsm::Graph< Id, Size > | |
maxCapacity() const | dsm::Graph< Id, Size > | inline |
nodeSet() const | dsm::Graph< Id, Size > | inline |
nodeSet() | dsm::Graph< Id, Size > | inline |
operator=(const Graph< Id, Size > &other) (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | inline |
operator=(Graph< Id, Size > &&)=default (defined in dsm::Graph< Id, Size >) | dsm::Graph< Id, Size > | |
shortestPath(const Node< Id, Size > &source, const Node< Id, Size > &destination) const | dsm::Graph< Id, Size > | |
shortestPath(Id source, Id destination) const | dsm::Graph< Id, Size > | |
street(Id source, Id destination) const | dsm::Graph< Id, Size > | |
streetSet() const | dsm::Graph< Id, Size > | inline |
streetSet() | dsm::Graph< Id, Size > | inline |