LISTSERV mailing list manager LISTSERV 16.0

Help for MASON-INTEREST-L Archives


MASON-INTEREST-L Archives

MASON-INTEREST-L Archives


MASON-INTEREST-L@LISTSERV.GMU.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

MASON-INTEREST-L Home

MASON-INTEREST-L Home

MASON-INTEREST-L  July 2015

MASON-INTEREST-L July 2015

Subject:

Re: MASON and JUNG: Portrayal Class

From:

Sean Luke <[log in to unmask]>

Reply-To:

MASON Multiagent Simulation Toolkit <[log in to unmask]>

Date:

Wed, 22 Jul 2015 10:16:59 +0200

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (30 lines)

On Jul 21, 2015, at 3:44 PM, Tschanen Miriam <[log in to unmask]> wrote:

> While digging through the NetwortPortrayal2D code I noticed something strange. I found this line in the hitOrDraw method:
> 
> if (edgemap.containsKey(edge)) continue;
>                edgemap.put(edge, edge);
> 
> I cannot for the live of me imagine why anyone would add an object to a HashMap as both key and value. Why not just use a set? Is this an oversight, or am I missing something crucial here?

Nope, it's just being used as a set.


> Also, my graph is static and does not change at all during the simulation, so there would be no reason to redraw it at every time step. I found a flag called immutableField in the FieldPortrayal class, is setting this value to true enough to prevent redrawing? Or is there something else I need to do?

No.  immutableField just informs the FieldPortrayal that the field will never be changing (as is the case for you), and so the FieldPortrayal can *cache* its drawing and just re-draw the cache rather than rebuild it, if that's useful.

What you're looking for is some kind of flag that tells a FieldPortrayal to only redraw itself when (say) the window is resized or scrolled or scaled, but NOT when the timestep is updated.  Unfortunately this isn't feasible, but not for the reason you think.  It's because the display doesn't know if there are *multiple* FieldPortrayals stacked on top of one another, so perhaps the window has been wiped and the FieldPortrayal *must* redraw.

If you'd like to be fast, I suggest that you cache your drawing into an image an re-draw that unless the FieldPortrayal has been declared dirty, at which time you redraw into the image again.

If you absolutely know that you'll only have *one* FieldPortrayal in the display, maybe I can suggest an approach to hack something up in the Display2D to not redraw on a step().

> And finally, I would like to highlight certain edges during the simulation, e.g. the shortest path between two nodes for any pair of nodes selected by the user. What would be the easiest way to implement the highlighting? I'm not looking for a complete example, just some pointers to get me started. Can this be done without redrawing the entire graph?

You'll probably have to redraw the whole graph unless you hack something.  Highlighting is probably most easily done by making a custom subclass of EdgePortrayal2D which checks to see if the underlying edge is one which you want highlighted. 

Another approach is to create a SECOND NetworkPortrayal2D, overlaid on top of the first one, which has a custom subclass of EdgePortrayal2D that either draws (in a custom color) or doesn't draw at all, depending on whether the underlying edge is the one you want highlighted.  The advantage of this method is that you can use your immutableField flag to cache the underlying EdgePortrayal2D and it might be faster that way.

Sean

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

January 2023
November 2022
April 2022
March 2022
January 2022
November 2021
May 2021
April 2021
March 2021
February 2021
August 2020
July 2020
June 2020
February 2020
August 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
October 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
September 2017
June 2017
May 2017
March 2017
February 2017
January 2017
December 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
February 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
July 2004
May 2004
April 2004
March 2004

ATOM RSS1 RSS2



LISTSERV.GMU.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager