QuickGraph: A 100% C# Graph Library with Graphviz Support

/// QuickGraph Library 
/// 
/// Copyright (c) 2003 Jonathan de Halleux
///
/// This software is provided 'as-is', without any express or implied warranty. 
/// 
/// In no event will the authors be held liable for any damages arising from 
/// the use of this software.
/// Permission is granted to anyone to use this software for any purpose, 
/// including commercial applications, and to alter it and redistribute it 
/// freely, subject to the following restrictions:
///
///		1. The origin of this software must not be misrepresented; 
///		you must not claim that you wrote the original software. 
///		If you use this software in a product, an acknowledgment in the product 
///		documentation would be appreciated but is not required.
///
///		2. Altered source versions must be plainly marked as such, and must 
///		not be misrepresented as being the original software.
///
///		3. This notice may not be removed or altered from any source 
///		distribution.
///		
///		QuickGraph Library HomePage: http://www.dotnetwiki.org
///		Author: Jonathan de Halleux


using System;

namespace QuickGraphNUnit.Generators
{
	using QuickGraph.Providers;
	using QuickGraph.Concepts;
	using QuickGraph.Concepts.Modifications;
	using QuickGraph.Concepts.Traversals;
	using QuickGraph.Representations;

	/// <summary>
	/// Description r�sum�e de AdjacencyGraphGenerator.
	/// </summary>
	public class BidirectionalGraphGenerator : 
		IGraphGenerator,
		IMutableGraphGenerator,
		IMutableIncidenceGraphGenerator,
		IIncidenceGraphGenerator,
		IVertexListGraphGenerator,
		IMutableEdgeListGraphGenerator
	{
		public BidirectionalGraph G
		{
			get
			{
				return new BidirectionalGraph(new VertexAndEdgeProvider(),true);
			}
		}

		public BidirectionalGraph ACyclicGraph
		{
			get
			{
				BidirectionalGraph g =  new BidirectionalGraph(new VertexAndEdgeProvider(),true);
				IVertex u = g.AddVertex();
				IVertex v = g.AddVertex();
				IVertex w = g.AddVertex();
				g.AddEdge(u,v);
				g.AddEdge(v,w);
				g.AddEdge(u,w);

				return g;
			}
		}

		public BidirectionalGraph CyclicGraph
		{
			get
			{
				BidirectionalGraph g =  new BidirectionalGraph(new VertexAndEdgeProvider(),true);
				IVertex u = g.AddVertex();
				IVertex v = g.AddVertex();
				IVertex w = g.AddVertex();
				g.AddEdge(u,v);
				g.AddEdge(v,w);
				g.AddEdge(w,u);

				return g;
			}
		}
		public IGraph Graph(bool pe)
		{
			return new BidirectionalGraph(new VertexAndEdgeProvider(),pe);
		}
		public IEdgeMutableGraph MutableGraph
		{
			get
			{
				return this.G;
			}
		}
		public IMutableIncidenceGraph MutableIncidenceGraph
		{
			get
			{
				
				return this.G;
			}
		}
		public IIncidenceGraph IncidenceGraph
		{
			get
			{
				return this.ACyclicGraph;
			}
		}
		public IMutableEdgeListGraph MutableEdgeListGraph
		{
			get
			{
				return this.ACyclicGraph;
			}
		}
		public IVertexListGraph VertexList
		{
			get
			{
				return this.ACyclicGraph;
			}
		}
		public int VertexListCount
		{
			get
			{
				return 3;
			}
		}
	}
}