# HG changeset patch # User Balazs Dezso # Date 1326319085 -3600 # Node ID 4441b066368c914d13c713d9ba845990ff435068 # Parent 8b2b9e61d8ce0c7d36703ed5ee1df45acc8a9a17 Doc fix in BpGraphs (#69) diff -r 8b2b9e61d8ce -r 4441b066368c lemon/concepts/bpgraph.h --- a/lemon/concepts/bpgraph.h Wed Jan 11 22:43:50 2012 +0100 +++ b/lemon/concepts/bpgraph.h Wed Jan 11 22:58:05 2012 +0100 @@ -774,28 +774,28 @@ /// \brief Converts the node to red node object. /// - /// This class is converts unsafely the node to red node + /// This function converts unsafely the node to red node /// object. It should be called only if the node is from the red /// partition or INVALID. RedNode asRedNodeUnsafe(const Node&) const { return RedNode(); } /// \brief Converts the node to blue node object. /// - /// This class is converts unsafely the node to blue node + /// This function converts unsafely the node to blue node /// object. It should be called only if the node is from the red /// partition or INVALID. BlueNode asBlueNodeUnsafe(const Node&) const { return BlueNode(); } /// \brief Converts the node to red node object. /// - /// This class is converts safely the node to red node + /// This function converts safely the node to red node /// object. If the node is not from the red partition, then it /// returns INVALID. RedNode asRedNode(const Node&) const { return RedNode(); } /// \brief Converts the node to blue node object. /// - /// This class is converts unsafely the node to blue node + /// This function converts unsafely the node to blue node /// object. If the node is not from the blue partition, then it /// returns INVALID. BlueNode asBlueNode(const Node&) const { return BlueNode(); } diff -r 8b2b9e61d8ce -r 4441b066368c lemon/concepts/graph_components.h --- a/lemon/concepts/graph_components.h Wed Jan 11 22:43:50 2012 +0100 +++ b/lemon/concepts/graph_components.h Wed Jan 11 22:58:05 2012 +0100 @@ -318,7 +318,7 @@ /// \brief Class to represent red nodes. /// /// This class represents the red nodes of the graph. The red - /// nodes can be used also as normal nodes. + /// nodes can also be used as normal nodes. class RedNode : public Node { typedef Node Parent; @@ -347,7 +347,7 @@ /// \brief Class to represent blue nodes. /// /// This class represents the blue nodes of the graph. The blue - /// nodes can be used also as normal nodes. + /// nodes can also be used as normal nodes. class BlueNode : public Node { typedef Node Parent; @@ -402,28 +402,28 @@ /// \brief Converts the node to red node object. /// - /// This class is converts unsafely the node to red node + /// This function converts unsafely the node to red node /// object. It should be called only if the node is from the red /// partition or INVALID. RedNode asRedNodeUnsafe(const Node&) const { return RedNode(); } /// \brief Converts the node to blue node object. /// - /// This class is converts unsafely the node to blue node + /// This function converts unsafely the node to blue node /// object. It should be called only if the node is from the red /// partition or INVALID. BlueNode asBlueNodeUnsafe(const Node&) const { return BlueNode(); } /// \brief Converts the node to red node object. /// - /// This class is converts safely the node to red node + /// This function converts safely the node to red node /// object. If the node is not from the red partition, then it /// returns INVALID. RedNode asRedNode(const Node&) const { return RedNode(); } /// \brief Converts the node to blue node object. /// - /// This class is converts unsafely the node to blue node + /// This function converts unsafely the node to blue node /// object. If the node is not from the blue partition, then it /// returns INVALID. BlueNode asBlueNode(const Node&) const { return BlueNode(); }