Naloga/Podatkovne strukture in algoritmi/Barvanje grafa/Namig (Java)

Iz MaFiRaWiki

import java.util.*;
 
public class Graf
{
  
  private HashMap<Integer, Vector<Integer>> sosedi;
  private int n;
  private int[] barvanje;
  
  public Graf(int n)
  {
    this.n = n;
    sosedi = new HashMap<Integer, Vector<Integer>>();
    barvanje = new int[n];
    
    for (int i=0; i<n; i++)
      sosedi.put(i, new Vector<Integer>() );
  }
  
  public Vector<Integer> sosedi(int i)
  {
    return sosedi.get(i);
  }
  
  public void dodajPovezavo(int i, int j)
  {
    sosedi.get(i).add(j);
    sosedi.get(j).add(i);
  }
  
  public boolean pobarvajGraf(int k)
  {
    return false;
  }
}