public TestGraphvizVertex(VertexStringDictionary names)
{
m_Names = names;
m_Vertex = new GraphvizVertex();
m_Vertex.Shape = GraphvizVertexShape.Hexagon;
m_Vertex.Style = GraphvizVertexStyle.Filled;
m_Vertex.ToolTip = "This is a tooltip";
m_Vertex.Url = "http://www.dotnetwiki.org";
m_Vertex.StrokeColor = Color.Red;
m_Vertex.FillColor = Color.LightGray;
m_Vertex.FontColor = Color.Blue;
m_Vertex.Orientation = 45;
m_Vertex.Regular = true;
m_Vertex.Sides = 2;
m_Edge = new GraphvizEdge();
m_Edge.HeadArrow = new GraphvizArrow(GraphvizArrowShape.Box);
m_Edge.HeadArrow.Clipping = GraphvizArrowClipping.Left;
m_Edge.HeadArrow.Filling = GraphvizArrowFilling.Open;
m_Edge.TailArrow = new GraphvizArrow(GraphvizArrowShape.Dot);
m_Edge.Label.Value = "This is an edge";
}
/// <summary>
/// Test for the <seealso cref="DijkstraShortestPath"/> algorithm.
/// </summary>
/// <param name="dij">alog.</param>
/// <param name="names">Vertex name map</param>
public TestDijkstraShortestPathVisitor(
DijkstraShortestPathAlgorithm dij,
VertexStringDictionary names
)
{
m_Names = names;
dij.InitializeVertex += new VertexHandler(this.InitializeVertex);
dij.DiscoverVertex += new VertexHandler(this.DiscoverVertex);
dij.ExamineVertex += new VertexHandler(this.ExamineVertex);
dij.ExamineEdge += new EdgeHandler(this.ExamineEdge);
dij.EdgeRelaxed += new EdgeHandler(this.EdgeRelaxed);
dij.EdgeNotRelaxed += new EdgeHandler(this.EdgeNotRelaxed);
dij.FinishVertex += new VertexHandler(this.FinishVertex);
}
public FileDependencyTest()
{
m_Vertex = new GraphvizVertex();
m_Names = new VertexStringDictionary();
}
