Esempio n. 1
0
 /// <summary>
 /// Builds a new empty graph
 /// </summary>
 public BidirectionalGraph(
     IVertexAndEdgeProvider provider,
     bool allowParallelEdges
     )
     : base(provider,allowParallelEdges)
 {
     m_VertexInEdges = new VertexEdgesDictionary();
 }
 /// <summary>
 /// Builds a new empty graph
 /// </summary>
 public BidirectionalGraph(
     IVertexAndEdgeProvider provider,
     bool allowParallelEdges
     )
     : base(provider, allowParallelEdges)
 {
     m_VertexInEdges = new VertexEdgesDictionary();
 }
Esempio n. 3
0
        /// <summary>
        /// Builds a new empty directed graph
        /// </summary>
        public AdjacencyGraph(
            IVertexAndEdgeProvider provider,
            bool allowParallelEdges
            )
        {
            if (provider == null)
                throw new ArgumentNullException("provider");

            m_Provider = provider;
            m_AllowParallelEdges = allowParallelEdges;
            m_VertexOutEdges = new VertexEdgesDictionary();
            m_Edges = new EdgeCollection();
        }
Esempio n. 4
0
        /// <summary>
        /// Builds a new empty directed graph
        /// </summary>
        public AdjacencyGraph(
            IVertexAndEdgeProvider provider,
            bool allowParallelEdges
            )
        {
            if (provider == null)
            {
                throw new ArgumentNullException("provider");
            }

            m_Provider           = provider;
            m_AllowParallelEdges = allowParallelEdges;
            m_VertexOutEdges     = new VertexEdgesDictionary();
            m_Edges = new EdgeCollection();
        }