Implementing Dijkstra's algorithm using BGL graph

I am trying to implement 开发者_开发知识库Dijkstra's shortest path algorithm using BGL libraries in OMNET++

In course of doing so, I came across we need Graphviz DOT file for the same.

How do I create DOT file for the algorithm using graphviz?

You can create DOT files by hand pretty easily. The file format is fairly simple and documented on Wikipedia and on the graphviz website.

Here's a sample of a simple acyclic directed graph.

digraph graph-name {
     a -> b -> c;
     b -> d;
 }