package fr.umlv.graph;

import java.util.Iterator;

public interface Graph {
  public static final int NO_WEIGHT = Integer.MIN_VALUE;
  
  public int verticesCount(); 
  
  public boolean hasEdge(int src, int dst); 
  public int getWeight(int src, int dst);
  public boolean addEdge(int src, int dst, int weight); 
  public boolean removeEdge(int src, int dst); 
  
  public Iterator<Integer> neighbors(int vertex);
  //public Iterator<Edge> edges(int vertex);
}