Commit e13afb9

committed

1 parent 1c9cfe8 commit e13afb9Copy full SHA for e13afb9

File tree

+34

-3

lines changed

+34

-3

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+package DataAndAlgoL.Chpt9GraphAlgorithms;`
	`2`	`+`
	`3`	`+import java.util.ArrayList;`
	`4`	`+import DataAndAlgoL.Chp3LinkedLists.ListNode;`
	`5`	`+//import DataAndAlgoL.Chp3LinkedLists.LinkedList;`
	`6`	`+`
	`7`	`+public class GraphAdjList {`
	`8`	`+ ArrayList<Integer> vertices;`
	`9`	`+ ListNode[] edges;`
	`10`	`+ int vertexCount=0;`
	`11`	`+`
	`12`	`+ public GraphAdjList(int vertexCount){`
	`13`	`+ this.vertexCount=vertexCount;`
	`14`	`+ vertices= new ArrayList<>();`
	`15`	`+ edges= new ListNode[vertexCount];`
	`16`	`+ for(int i=0; i< vertexCount; i++){`
	`17`	`+ vertices.add(i);`
	`18`	`+ edges[i]= new ListNode(0);`
	`19`	`+ }`
	`20`	`+ }`
	`21`	`+`
	`22`	`+ public void addEdge(int source, int destination){`
	`23`	`+ int i= vertices.indexOf(source);`
	`24`	`+ int j= vertices.indexOf(destination);`
	`25`	`+`
	`26`	`+ if(i != -1 && j != -1){`
	`27`	`+ // edges[i].insertAtBeginning(destination);`
	`28`	`+ // edges[j].insertAtBeginning(source);`
	`29`	`+ }`
	`30`	`+ }`
	`31`	`+}`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,11 +1,11 @@`
`1`	`1`	`package DataAndAlgoL.Chpt9GraphAlgorithms;`
`2`		`-//below class reads an undirected graph`
`3`		`-public class Graph {`
	`2`	`+//Adjacency Matrix representation`
	`3`	`+public class GraphAdjMatrix {`
`4`	`4`	`public boolean adjMatrix[][];`
`5`	`5`	`public int vertexCount;`
`6`	`6`
`7`	`7`	`//constructor`
`8`		`- public Graph(int vertexCount){`
	`8`	`+ public GraphAdjMatrix(int vertexCount){`
`9`	`9`	`this.vertexCount= vertexCount;`
`10`	`10`	`adjMatrix= new boolean[vertexCount][vertexCount]; //boolean 2-d array as a matrix with a max amount o VxV vertices`
`11`	`11`	`}`

Comments

(0)