Jump to content
Canhola

contar numero de edges num treemap graph

Recommended Posts

Canhola

boas,

é assim, não estou a conseguir implementar o metodo int edge( ), que consiste em retornar o número de arestas num grafo dirigido.

O graph contém nós e arestas.

Saber o numero de nós é facil:

public int nodes()
{
   return map.size();
}

Mas para saber o numero de arestas é mais complicado.

Esta é a classe do graph:

public class SMGraph<N extends Comparable<? super N>> implements Graph<N>
{

   private TreeMap<N,TreeSet<N>> map;

   /**
    * Constructor.
    */
   public SMGraph()
   {
       map = new TreeMap<N, TreeSet<N>>();
   }

   public int edges()
   {

   }

Obrigado desde já!

Edited by Rui Carlos

Share this post


Link to post
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Restore formatting

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.


×
×
  • Create New...

Important Information

By using this site you accept our Terms of Use and Privacy Policy. We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.