/** Use example for DGraph and DAGraph classes * */
public static void ExampleDGraph() {
try {
String name = "DGraph";
// create the directory to save files
File f = new File(outputDir + name);
f.mkdir();
// create the Readme file
name = name + File.separator + name;
BufferedWriter file = new BufferedWriter(new FileWriter(outputDir + name + "Readme.txt"));
String log = "EXAMPLE FOR DGRAPH AND DAGRAPH CLASSES\n";
log += "--------------------------------------\n";
System.out.println(log);
file.write(log);
// randomly generates a directed graph of 5 nodes
DGraph G = DGraph.random(10);
String nameGraph = name + ".dot";
G.save(outputDir + nameGraph);
log = "-> Randomly generated DGraph saved in " + nameGraph + "\n";
System.out.println(log + G.toString());
file.write(log);
// compute the complementary graph
G.complementary();
String nameComp = name + "Complementary.dot";
G.save(outputDir + nameComp);
log = "-> Complementary graph saved in " + nameComp + "\n ";
System.out.println(log + G.toString());
// check if the dgraph is acyclic
log = "-> DGraph acyclic? " + G.isAcyclic() + "\n";
System.out.println(log);
file.write(log);
// computes and print the transitive closure of the dgraph
G.transitiveClosure();
String nameTransClosure = name + "TransitiveClosure.dot";
G.save(outputDir + nameTransClosure);
log = "-> Transitive closure saved in " + nameTransClosure + "\n";
System.out.println(log + G.toString());
file.write(log);
// computes and print a depth first search in the directed graph
ArrayList[] S = G.depthFirstSearch();
log = "-> Depth first search (first visited nodes): " + S[0] + "\n";
log += "Depth first search (last visited nodes): " + S[1] + "\n";
System.out.println(log);
file.write(log);
// computes and print the directed acyclic graph whose nodes
// are strongly connected components of the directed graph
DAGraph CC = G.getStronglyConnectedComponent();
String nameCC = name + "ConnectedComponents.dot";
CC.save(outputDir + nameCC);
log = "-> Strongly connected components saved in " + nameCC + "\n";
System.out.println(log + CC.toString());
file.write(log);
// verify that the dagraph is acyclic
log = nameCC + " acyclic? " + CC.isAcyclic() + "\n";
System.out.println(log);
file.write(log);
// computes and print the sugbraph of the dgraph induces by 5 first nodes
TreeSet<Node> X = new TreeSet();
for (Node n : G.getNodes()) if (X.size() != 5) X.add(n);
DGraph SG = G.getSubgraphByNodes(X);
String nameSG = name + "Subgraph.dot";
SG.save(outputDir + nameSG);
log = "-> Subgraph induced by 5 first nodes saved in " + nameSG + "\n";
System.out.println(log + SG.toString());
file.write(log);
file.close();
} catch (Exception e) {
}
}
