Edgy is a blocks-based programming environment designed for teaching graph algorithms at school. It provides blocks for creating and manipulating networks, i.e. collections of nodes and edges. Many important algorithms apply to graphs, such as Dijkstra's shortest path algorithm, Prim's minimal spanning tree algorithm, the Ford-Fulkerson max flow algorithm. Edgy also provides a novel way of introducing programming, data structures, and algorithmic problems solving. Edgy is free, open source, and available as a web application so there is nothing to install.

http://www.snap-apps.org/edgy.html

Looks awesome! Unfortunately, I'm a bit confused as to how it works. A little tutorial would be nice.

(Also, your tab title still says “Snap!”)

It's just giving me a blank page, and the console says “TypeError: world.doOneCycle is undefined”.

My browser / operating system: MacOS Macintosh X 10.10, Firefox 40.0, Flash 18.0 (release 0)

Works fine on Firefox for Windows (8.1), fyi.

I'm going to be looking at this with my mother, who (hopefully) knows more about graphs than me!

stevenbird1 wrote:

Edgy is a blocks-based programming environment designed for teaching graph algorithms at school. It provides blocks for creating and manipulating networks, i.e. collections of nodes and edges. Many important algorithms apply to graphs, such as Dijkstra's shortest path algorithm, Prim's minimal spanning tree algorithm, the Ford-Fulkerson max flow algorithm. Edgy also provides a novel way of introducing programming, data structures, and algorithmic problems solving. Edgy is free, open source, and available as a web application so there is nothing to install.

http://www.snap-apps.org/edgy.html

Cool! I usually use graphviz/dot for displaying compiler data structures (parse trees, ASTs, CFGs. SSA dependency graphs etc) but this is tempting.

@Pulljosh, a video tutorial is linked from that webpage. Also, you can right-click on blocks for documentation.

I can't find File->examples

Please use the file icon in the top left, and click on “open”, then “examples”.

I am working on a diagrammatic and graph explanation to finding the 240 solutions to the SOMA puzzle this should be a very nice environment for the various “cube property” graphs that accompany each class of solutions. With luck I will get something that approaches the elegance of the SOMAP but a little easier to understand.

http://www.fam-bundgaard.dk/SOMA/NEWS/N030518.HTM

Thanks!

Best regards,
Edward Vogel

EdV56 wrote:

I am working on a diagrammatic and graph explanation to finding the 240 solutions to the SOMA puzzle this should be a very nice environment for the various “cube property” graphs that accompany each class of solutions. With luck I will get something that approaches the elegance of the SOMAP but a little easier to understand.

http://www.fam-bundgaard.dk/SOMA/NEWS/N030518.HTM

Thanks!

Best regards,
Edward Vogel

looking at the diagram on that page, I had a memory of something from the very early days of the web (or possibly as far back as the days of gopher or wais) about some big topology problem - it may have involved a tesserect and various cycles of locations - I seem to remember it being couched in terms of advent/dungeon mazes but I think it was really related to group theory. There was some kind of online solver. It seemed very similar to this but it wasn't a block packing thing. Does this ring any bells for you? Maybe late 80's/early 90's?

The SOMAP is a “map” of the 240 Soma cube puzzle solutions. Each node is a solution written in a slightly arcane short hand of naming the pieces that are supplying the center of the cube and if it is deficient supplying a vertex (I think . . .a colleague is working on this) the edges describe the pieces that get exchanged (lots of two piece combo pieces . . .I think). The pieces are color coded again in difficult (for me) notation like B is for Black and L is for bLue. . .

There are great solvers for the this and other polycubes puzzles. This one is quite good:
http://puzzler.sourceforge.net/

What I am trying to do is split the difference between solving the puzzles with an exact cover algorithm and Conway's graphical method.

So no bells ringing about you actual question.