search

radudragusin / vispy

Automatically exported from code.google.com/p/vispy
0 stars 0 forks source link

Formulate student exercise #8

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago 
An exercise must be formulated covering the following:
  * Algorithm development
  * visualization of result of algorithm: prior algorithm, during algorithm, 
after algorithm
  * complexity analysis
  * Data structure development

Original issue reported on code.google.com by bmathiasen on 21 Apr 2010 at 3:08

GoogleCodeExporter commented 9 years ago 
== Problem: ==
Implement the Directed Graph data structure based on the supplied source code 
in 
graph.py.
NB! You should not need to alter the `vizMe()` method.
Hint: Directed Graphs may have several edges connecting any two nodes.
Hint2: the edge (1,2) is distinct from the edge (2,1).

Describe how you solved the problem. Demonstrate and visualize a number of test 
cases 
using the `vizMe()` method, to show your solution is working.

Original comment by bmathiasen on 23 Apr 2010 at 5:26

GoogleCodeExporter commented 9 years ago 
== Problem 2: ==
Implement the Undirected MultiGraph data structure based on the supplied source 
code 
in graph.py
NB! You should not need to alter the `vizMe()` method.
Hint: Undirected MultiGraphs may have several edges connecting any two nodes.
Hint2: Edges connecting any two nodes are only distinguishable through their 
weight 
and internal ID.

Describe how you solved the problem. Demonstrate and visualize a number of test 
cases 
using the `vizMe()` method, to show your solution is working.

Original comment by bmathiasen on 23 Apr 2010 at 5:29