Helsinki University of Technology
Laboratory of Information Processing Science
Tik-76.122 Data Structures and Algorithms
demo

Assignment 1 (2 points)

Below is a graph represented by the edges of the graph. Represent an adjacency list of the graph. Add all edges to the list in that order.

You can send an answer to this assignment at most 3 times.

Your browser can't run 1.0.2 Java applets.

Possible reason: Java language is disabled. For example with Netscape Navigator 3.x the Java language could be enabled in options-menu choosing Network Preferences/Languages/Enable Java.

Example

For the given edges below 

	AG AB AC LM JM JL JK ED FD HI FE AF GE,

the adjacency list would be as following 

		A:  F  C  B  G
		B:  A
		C:  A
		D:  F  E
		E:  G  F  D
		F:  A  E  D
		G:  E  A
		H:  I
		I:  H
		J:  K  L  M
		K:  J
		L:  J  M
		M:  J  L

Examine the order of nodes! Node A is put first into the list of node G and that's why it's the right most node. The same happens with node G and the list of node A. The first node put into the list is the last node of the list.