name: DiGraph <TObject> : private DoubleLinkedList< GraphVertex<TObject> >


g++ [flags ...] file ...

#include <DiGraph.h>

DiGraph(const DiGraph<TObject>& copy_graph);
boolean isWeighted() const;
boolean setWeighted(boolean is_weighted = true);
quick start:
// declare the graph object
DiGraph<Char> graph;

// create some data
Char* char_a = new Char('a');
Char* char_b = new Char('b');

// create and add the vertices to the graph
GraphVertex<Char>* vertex_a = graph.insertVertex(char_a);
GraphVertex<Char>* vertex_b = graph.insertVertex(char_b);

// draw arcs between the vertices
graph.insertArc(graph.getStart(), vertex_a, false, 0.75);
graph.insertArc(vertex_a, vertex_b, false, 0.75);
graph.insertArc(vertex_b, graph.getTerm(), false, 0.75);

// write it in an Sof file
String tmp_filename(L"graph");
Sof tmp_file;, File::WRITE_ONLY, File::TEXT);

graph.write(tmp_file, 1);

DiGraph is a generic directed graph template class. Internally, the DiGraph is stored as a list of DiGraphVertices. Each Vertex holds the information of the connection with other vertices.


public constants:

error codes:

protected data:

required public methods:

class-specific public methods:

private methods: