lemon-0.x: comparison lemon/graph

equal deleted inserted replaced

-:179dafd1a3a3
+:3760315da2a1
 /// Executes the writing commands.
 void run() {
 writer->run();
 }
+/// \brief Returns true if the writer can give back the labels by the items.
+///
+/// Returns true if the writer can give back the the labels by the items.
+bool isLabelWriter() const {
+return nodeset_writer.isLabelWriter() &&
+edgeset_writer.isLabelWriter();
+}
 /// \brief Write the label of the given node.
 ///
-/// It writes the label of the given node. If there was written an "label"
+/// It writes the label of the given node. If there was written a "label"
 /// named node map then it will write the map value belonging to the node.
 void writeLabel(std::ostream& os, const Node& item) const {
 nodeset_writer.writeLabel(os, item);
 }
 /// \brief Write the label of the given edge.
 ///
-/// It writes the label of the given edge. If there was written an "label"
+/// It writes the label of the given edge. If there was written a "label"
 /// named edge map then it will write the map value belonging to the edge.
 void writeLabel(std::ostream& os, const Edge& item) const {
 edgeset_writer.writeLabel(os, item);
 }
+/// \brief Sorts the given node vector by label.
+///
+/// Sorts the given node vector by label. If there was written an
+/// "label" named map then the vector will be sorted by the values
+/// of this map. Otherwise if the \c forceLabel parameter was true
+/// it will be sorted by its id in the graph.
+void sortByLabel(std::vector<Node>& nodes) const {
+nodeset_writer.sortByLabel(nodes);
+}
+/// \brief Sorts the given edge vector by label.
+///
+/// Sorts the given edge vector by label. If there was written an
+/// "label" named map then the vector will be sorted by the values
+/// of this map. Otherwise if the \c forceLabel parameter was true
+/// it will be sorted by its id in the graph.
+void sortByLabel(std::vector<Edge>& edges) const {
+edgeset_writer.sortByLabel(edges);
+}
 private:
 LemonWriter* writer;
 bool own_writer;
 /// Construct a new UGraphWriter. It writes the given graph
 /// to the given stream.
 UGraphWriter(std::ostream& _os, const Graph& _graph)
 : writer(new LemonWriter(_os)), own_writer(true),
 	nodeset_writer(*writer, _graph, std::string()),
-	u_edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
+	uedgeset_writer(*writer, _graph, nodeset_writer, std::string()),
 	node_writer(*writer, nodeset_writer, std::string()),
-	u_edge_writer(*writer, u_edgeset_writer, std::string()),
+	uedge_writer(*writer, uedgeset_writer, std::string()),
 	attribute_writer(*writer, std::string()) {}
 /// \brief Construct a new UGraphWriter.
 ///
 /// Construct a new UGraphWriter. It writes the given graph
 /// to the given file.
 UGraphWriter(const std::string& _filename, const Graph& _graph)
 : writer(new LemonWriter(_filename)), own_writer(true),
 	nodeset_writer(*writer, _graph, std::string()),
-	u_edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
+	uedgeset_writer(*writer, _graph, nodeset_writer, std::string()),
 	node_writer(*writer, nodeset_writer, std::string()),
-	u_edge_writer(*writer, u_edgeset_writer, std::string()),
+	uedge_writer(*writer, uedgeset_writer, std::string()),
 	attribute_writer(*writer, std::string()) {}
 /// \brief Construct a new UGraphWriter.
 ///
 /// Construct a new UGraphWriter. It writes the given graph
-/// to given LemonReader.
+/// to given LemonWriter.
 UGraphWriter(LemonWriter& _writer, const Graph& _graph)
 : writer(_writer), own_writer(false),
 	nodeset_writer(*writer, _graph, std::string()),
-	u_edgeset_writer(*writer, _graph, nodeset_writer, std::string()),
+	uedgeset_writer(*writer, _graph, nodeset_writer, std::string()),
 	node_writer(*writer, nodeset_writer, std::string()),
-	u_edge_writer(*writer, u_edgeset_writer, std::string()),
+	uedge_writer(*writer, uedgeset_writer, std::string()),
 	attribute_writer(*writer, std::string()) {}
 /// \brief Destruct the graph writer.
 ///
 /// Destruct the graph writer.
 ///
 /// This function issues a new <i> edge map writing command</i> to
 /// the writer.
 template <typename Map>
 UGraphWriter& writeEdgeMap(std::string label, const Map& map) {
-u_edgeset_writer.writeEdgeMap(label, map);
+uedgeset_writer.writeEdgeMap(label, map);
 return *this;
 }
 /// \brief Issue a new edge map writing command to the writer.
 ///
 /// This function issues a new <i> edge map writing command</i> to
 /// the writer.
 template <typename ItemWriter, typename Map>
 UGraphWriter& writeEdgeMap(std::string label, const Map& map,
 				   const ItemWriter& iw = ItemWriter()) {
-u_edgeset_writer.writeEdgeMap(label, map, iw);
+uedgeset_writer.writeEdgeMap(label, map, iw);
 return *this;
 }
 /// \brief Issue a new undirected edge map writing command to the writer.
 ///
 /// This function issues a new <i> undirected edge map writing
 /// command</i> to the writer.
 template <typename Map>
 UGraphWriter& writeUEdgeMap(std::string label, const Map& map) {
-u_edgeset_writer.writeUEdgeMap(label, map);
+uedgeset_writer.writeUEdgeMap(label, map);
 return *this;
 }
 /// \brief Issue a new undirected edge map writing command to the writer.
 ///
 /// This function issues a new <i> undirected edge map writing
 /// command</i> to the writer.
 template <typename ItemWriter, typename Map>
 UGraphWriter& writeUEdgeMap(std::string label, const Map& map,
 					const ItemWriter& iw = ItemWriter()) {
-u_edgeset_writer.writeUEdgeMap(label, map, iw);
+uedgeset_writer.writeUEdgeMap(label, map, iw);
 return *this;
 }
 /// \brief Issue a new labeled node writer to the writer.
 ///
 /// \brief Issue a new labeled edge writer to the writer.
 ///
 /// This function issues a new <i> labeled edge writing
 /// command</i> to the writer.
 UGraphWriter& writeEdge(std::string label, const Edge& edge) {
-u_edge_writer.writeEdge(label, edge);
+uedge_writer.writeEdge(label, edge);
 }
 /// \brief Issue a new labeled undirected edge writing command to
 /// the writer.
 ///
 /// Issue a new <i>labeled undirected edge writing command</i> to
 /// the writer.
 UGraphWriter& writeUEdge(std::string label, const UEdge& edge) {
-u_edge_writer.writeUEdge(label, edge);
+uedge_writer.writeUEdge(label, edge);
 }
 /// \brief Issue a new attribute writing command.
 ///
 /// This function issues a new <i> attribute writing
 /// Executes the writing commands.
 void run() {
 writer->run();
 }
+/// \brief Returns true if the writer can give back the labels by the items.
+///
+/// Returns true if the writer can give back the the labels by the items.
+bool isLabelWriter() const {
+return nodeset_writer.isLabelWriter() &&
+uedgeset_writer.isLabelWriter();
+}
 /// \brief Write the label of the given node.
 ///
-/// It writes the label of the given node. If there was written an "label"
+/// It writes the label of the given node. If there was written a "label"
 /// named node map then it will write the map value belonging to the node.
 void writeLabel(std::ostream& os, const Node& item) const {
 nodeset_writer.writeLabel(os, item);
 }
 /// \brief Write the label of the given edge.
 ///
-/// It writes the label of the given edge. If there was written an "label"
+/// It writes the label of the given edge. If there was written a "label"
 /// named edge map then it will write the map value belonging to the edge.
 void writeLabel(std::ostream& os, const Edge& item) const {
-u_edgeset_writer.writeLabel(os, item);
+uedgeset_writer.writeLabel(os, item);
 }
 /// \brief Write the label of the given undirected edge.
 ///
 /// It writes the label of the given undirected edge. If there was
-/// written an "label" named edge map then it will write the map
+/// written a "label" named edge map then it will write the map
 /// value belonging to the edge.
 void writeLabel(std::ostream& os, const UEdge& item) const {
-u_edgeset_writer.writeLabel(os, item);
+uedgeset_writer.writeLabel(os, item);
 }
+/// \brief Sorts the given node vector by label.
+///
+/// Sorts the given node vector by label. If there was written an
+/// "label" named map then the vector will be sorted by the values
+/// of this map. Otherwise if the \c forceLabel parameter was true
+/// it will be sorted by its id in the graph.
+void sortByLabel(std::vector<Node>& nodes) const {
+nodeset_writer.sortByLabel(nodes);
+}
+/// \brief Sorts the given edge vector by label.
+///
+/// Sorts the given edge vector by label. If there was written an
+/// "label" named map then the vector will be sorted by the values
+/// of this map. Otherwise if the \c forceLabel parameter was true
+/// it will be sorted by its id in the graph.
+void sortByLabel(std::vector<Edge>& edges) const {
+uedgeset_writer.sortByLabel(edges);
+}
+/// \brief Sorts the given undirected edge vector by label.
+///
+/// Sorts the given undirected edge vector by label. If there was
+/// written an "label" named map then the vector will be sorted by
+/// the values of this map. Otherwise if the \c forceLabel
+/// parameter was true it will be sorted by its id in the graph.
+void sortByLabel(std::vector<UEdge>& uedges) const {
+uedgeset_writer.sortByLabel(uedges);
+}
 private:
 LemonWriter* writer;
 bool own_writer;
 NodeSetWriter<Graph, WriterTraits> nodeset_writer;
-UEdgeSetWriter<Graph, WriterTraits> u_edgeset_writer;
+UEdgeSetWriter<Graph, WriterTraits> uedgeset_writer;
 NodeWriter<Graph> node_writer;
-UEdgeWriter<Graph> u_edge_writer;
+UEdgeWriter<Graph> uedge_writer;
 AttributeWriter<WriterTraits> attribute_writer;
 };
 /// @}

changeset 2483	bf6d7b624d5c
parent 2391	14a343be7a5a
child 2502	9c23c3762bc5