HW5 and Java code about graph

[Haidong (Haydon) Xue]

Hi all, 

HW5 has just been posted.

An implementation of adjacency-list and related code are also posted. 

Implementing BFS and DFS for adjacency-matrix is part of HW5. 

--
Haidong(Haydon) Xue
Ph.D Candidate
Research Assistant, Teaching Instructor
Department of Computer Science
Georgia State University

http://www.cs.gsu.edu/~hxue1

[Brian Wells]

It appears to me that in the following method in the posted class GraphAdjacencyList should be revised as follows:

@Override
	public void printInfo()
	{
		// vertices
		for( Vertex v : vertices)
		{
			v.printInfo();
			System.out.print(" ");
		}
		System.out.println();
		
		// edges
		for( ArcNode head : adjL )
		{
			for( ArcNode n=head; n!=null; n=n.next)
			{
				head.edge.printInfo();
				System.out.print(" ");
			}	
		}
		System.out.println();
	}

Should be:

@Override
	public void printInfo()
	{
		// vertices
		for( Vertex v : vertices)
		{
			v.printInfo();
			System.out.print(" ");
		}
		System.out.println();
		
		// edges
		for( ArcNode head : adjL )
		{
			for( ArcNode n=head; n!=null; n=n.next)
			{
				n.edge.printInfo();
				System.out.print(" ");
			}	
		}
		System.out.println();
	}
Brian Wells

---

From: gsu-csc4520...@googlegroups.com [gsu-csc4520...@googlegroups.com] on behalf of Haidong (Haydon) Xue [haido...@gmail.com]
Sent: Monday, July 09, 2012 3:27 PM
To: gsu-csc4520...@googlegroups.com
Subject: HW5 and Java code about graph

[Haidong (Haydon) Xue]

You are definitely correct. Updated. Thank you. +2