/// <summary> /// Is Bounded (digraph) /// </summary> /// <param name="vx"></param> /// <param name="vy"></param> /// <returns></returns> bool is_bounded(Vertice vx, Vertice vy) { foreach (var aresta in grafo.Arestas) { if (grafo.isDigraph) { if (aresta.vertice1._id == vx._id && aresta.vertice2._id == vy._id) { return(true); } } else { if ((aresta.vertice1._id == vx._id && aresta.vertice2._id == vy._id) || (aresta.vertice1._id == vy._id && aresta.vertice2._id == vx._id)) { return(true); } } } return(false); }
public bool Contains(Vertice v) { return(vertice1.Equals(v) || vertice2.Equals(v)); }
/// <summary> /// Get all neighborhoods of an vertex /// </summary> /// <param name="v"></param> /// <returns></returns> public List <int> get_Adj(Vertice v) { return(Adj[v._id]); }
/// <summary> /// Removes Vertice from Grafo. /// </summary> /// <param name="v"></param> public void RemoveVertice(Vertice v) { Adj.Clear_adj(v, this); Vertices.Remove(v); }
/// <summary> /// Adds Vertice into Grafo. /// </summary> /// <param name="v"></param> public void AddVertice(Vertice v) { Vertices.Add(v); Adj.Update(this); }
/// <summary> /// Removes Vertice from Grafo. /// </summary> /// <param name="v"></param> public void RemoveVertice(Vertice v) { Vertices.Remove(v); }
/// <summary> /// Adds Vertice into Grafo. /// </summary> /// <param name="v"></param> public void AddVertice(Vertice v) { Vertices.Add(v); }