equal
deleted
inserted
replaced
302 /// \brief Gives back the node by the unique id. |
302 /// \brief Gives back the node by the unique id. |
303 /// |
303 /// |
304 /// Gives back the node by the unique id. |
304 /// Gives back the node by the unique id. |
305 /// If the graph does not contain node with the given id |
305 /// If the graph does not contain node with the given id |
306 /// then the result of the function is undetermined. |
306 /// then the result of the function is undetermined. |
307 Node fromId(int id, Node) const { return INVALID;} |
307 Node fromId(int , Node) const { return INVALID;} |
308 |
308 |
309 /// \brief Gives back an unique integer id for the Edge. |
309 /// \brief Gives back an unique integer id for the Edge. |
310 /// |
310 /// |
311 /// Gives back an unique integer id for the Edge. |
311 /// Gives back an unique integer id for the Edge. |
312 /// |
312 /// |
315 /// \brief Gives back the edge by the unique id. |
315 /// \brief Gives back the edge by the unique id. |
316 /// |
316 /// |
317 /// Gives back the edge by the unique id. |
317 /// Gives back the edge by the unique id. |
318 /// If the graph does not contain edge with the given id |
318 /// If the graph does not contain edge with the given id |
319 /// then the result of the function is undetermined. |
319 /// then the result of the function is undetermined. |
320 Edge fromId(int id, Edge) const { return INVALID;} |
320 Edge fromId(int, Edge) const { return INVALID;} |
321 |
321 |
322 template <typename _Graph> |
322 template <typename _Graph> |
323 struct Constraints { |
323 struct Constraints { |
324 |
324 |
325 void constraints() { |
325 void constraints() { |
396 |
396 |
397 /// Adds a new Edge connects the two Nodes to the graph. |
397 /// Adds a new Edge connects the two Nodes to the graph. |
398 |
398 |
399 /// Adds a new Edge connects the two Nodes to the graph. |
399 /// Adds a new Edge connects the two Nodes to the graph. |
400 /// |
400 /// |
401 Edge addEdge(const Node& from, const Node& to) { |
401 Edge addEdge(const Node&, const Node&) { |
402 return INVALID; |
402 return INVALID; |
403 } |
403 } |
404 |
404 |
405 template <typename _Graph> |
405 template <typename _Graph> |
406 struct Constraints { |
406 struct Constraints { |
743 /// Construct a new map for the graph and initalise the values. |
743 /// Construct a new map for the graph and initalise the values. |
744 GraphMap(const Graph&, const _Value&) {} |
744 GraphMap(const Graph&, const _Value&) {} |
745 /// \brief Copy constructor. |
745 /// \brief Copy constructor. |
746 /// |
746 /// |
747 /// Copy Constructor. |
747 /// Copy Constructor. |
748 GraphMap(const GraphMap&) {} |
748 GraphMap(const GraphMap& gm) :ReadWriteMap<Item, _Value>(gm) {} |
749 |
749 |
750 /// \brief Assign operator. |
750 /// \brief Assign operator. |
751 /// |
751 /// |
752 /// Assign operator. |
752 /// Assign operator. |
753 GraphMap& operator=(const GraphMap&) { return *this;} |
753 GraphMap& operator=(const GraphMap&) { return *this;} |
807 /// Construct a new map for the graph and initalise the values. |
807 /// Construct a new map for the graph and initalise the values. |
808 NodeMap(const Graph&, const _Value&) {} |
808 NodeMap(const Graph&, const _Value&) {} |
809 /// \brief Copy constructor. |
809 /// \brief Copy constructor. |
810 /// |
810 /// |
811 /// Copy Constructor. |
811 /// Copy Constructor. |
812 NodeMap(const NodeMap&) {} |
812 NodeMap(const NodeMap& nm) : GraphMap<Graph, Node, _Value>(nm) {} |
813 |
813 |
814 /// \brief Assign operator. |
814 /// \brief Assign operator. |
815 /// |
815 /// |
816 /// Assign operator. |
816 /// Assign operator. |
817 NodeMap& operator=(const NodeMap&) { return *this;} |
817 NodeMap& operator=(const NodeMap&) { return *this;} |
837 /// Construct a new map for the graph and initalise the values. |
837 /// Construct a new map for the graph and initalise the values. |
838 EdgeMap(const Graph&, const _Value&) {} |
838 EdgeMap(const Graph&, const _Value&) {} |
839 /// \brief Copy constructor. |
839 /// \brief Copy constructor. |
840 /// |
840 /// |
841 /// Copy Constructor. |
841 /// Copy Constructor. |
842 EdgeMap(const EdgeMap&) {} |
842 EdgeMap(const EdgeMap& em) :GraphMap<Graph, Edge, _Value>(em) {} |
843 |
843 |
844 /// \brief Assign operator. |
844 /// \brief Assign operator. |
845 /// |
845 /// |
846 /// Assign operator. |
846 /// Assign operator. |
847 EdgeMap& operator=(const EdgeMap&) { return *this;} |
847 EdgeMap& operator=(const EdgeMap&) { return *this;} |
915 } |
915 } |
916 |
916 |
917 /// \brief Add an edge to the graph. |
917 /// \brief Add an edge to the graph. |
918 /// |
918 /// |
919 /// Add an edge to the graph and notify the observers. |
919 /// Add an edge to the graph and notify the observers. |
920 Edge addEdge(const Node& from, const Node& to) { |
920 Edge addEdge(const Node&, const Node&) { |
921 return INVALID; |
921 return INVALID; |
922 } |
922 } |
923 |
923 |
924 template <typename _Graph> |
924 template <typename _Graph> |
925 struct Constraints { |
925 struct Constraints { |