WeightedEdgeListGraphOutputAdapter.java

package i5.las2peer.services.ocd.adapters.graphOutput;

import i5.las2peer.services.ocd.adapters.AdapterException;
import i5.las2peer.services.ocd.graphs.CustomGraph;

import java.io.Writer;

import y.base.Edge;
import y.base.EdgeCursor;

/**
 * A graph output adapter for weighted edge list format.
 * Each line of output contains first the name of a source node of an edge, then the name of a target node of an edge
 * and finally a double value as the edge weight (optional), using the space character (' ') as a delimiter. There is one line for each edge.
 * @author Sebastian
 * 
 */
public class WeightedEdgeListGraphOutputAdapter extends AbstractGraphOutputAdapter {

	boolean weighted = true;
	
	/**
	 * Creates a new instance setting the writer attribute.
	 * @param writer The writer used for output.
	 */
	public WeightedEdgeListGraphOutputAdapter(Writer writer) {
		this.setWriter(writer);
	}

	/**
	 * Creates a new instance.
	 */
	public WeightedEdgeListGraphOutputAdapter() {
	}
	
	public boolean isWeighted() {
		return weighted;
	}

	public void setWeighted(boolean weighted) {
		this.weighted = weighted;
	}

	@Override
	public void writeGraph(CustomGraph graph) throws AdapterException {
		try {
			EdgeCursor edges = graph.edges();
			Edge edge;
			while(edges.ok()) {
				edge = edges.edge();
				writer.write(graph.getNodeName(edge.source()) + " ");
				writer.write(graph.getNodeName(edge.target()));
				if(weighted) {
					writer.write(" " + String.format("%.2f", graph.getEdgeWeight(edge)));
				}
				edges.next();
				if(edges.ok()) {
					writer.write("\n");
				}
			}
		}
		catch (Exception e) {
			throw new AdapterException(e);
		}
		finally {
			try {
				writer.close();
			}
			catch (Exception e) {
			}
		}
	}
	
}