Commit 12948b4

committed

add some images for graph

1 parent af00840 commit 12948b4Copy full SHA for 12948b4

File tree

+39

-5

lines changed

+39

-5

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,33 @@`
	`1`	`+package ir.sk.adt.datastructure.graph;`
	`2`	`+`
	`3`	`+public class IncidenceMatrix {`
	`4`	`+ private final int rows;`
	`5`	`+ private final int cols;`
	`6`	`+ private int[][] incidence_matrix;`
	`7`	`+`
	`8`	`+ public IncidenceMatrix(int v, int e) {`
	`9`	`+ rows = v;`
	`10`	`+ cols = e;`
	`11`	`+ incidence_matrix = new int[rows + 1][cols + 1];`
	`12`	`+ }`
	`13`	`+`
	`14`	`+ public void makeEdge(int to, int from, int edge, int edge_number) {`
	`15`	`+ try {`
	`16`	`+ incidence_matrix[to][edge_number] = edge;`
	`17`	`+ incidence_matrix[from][edge_number] = edge;`
	`18`	`+ }`
	`19`	`+ catch (ArrayIndexOutOfBoundsException index) {`
	`20`	`+ System.out.println("The vertices does not exists");`
	`21`	`+ }`
	`22`	`+ }`
	`23`	`+`
	`24`	`+ public int getEdge(int edge_number, int v) {`
	`25`	`+ try {`
	`26`	`+ return incidence_matrix[edge_number][v];`
	`27`	`+ }`
	`28`	`+ catch (ArrayIndexOutOfBoundsException index) {`
	`29`	`+ System.out.println("The vertices does not exists");`
	`30`	`+ }`
	`31`	`+ return -1;`
	`32`	`+ }`
	`33`	`+}`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package ir.sk.adt.queue.circularqueue;`
	`1`	`+package ir.sk.adt.queue.circulararrayqueue;`
`2`	`2`
`3`	`3`	`import ir.sk.adt.queue.Queue;`
`4`	`4`	`import ir.sk.helper.Default;`
`@@ -25,7 +25,7 @@`
`25`	`25`	`* @param <T>`
`26`	`26`	`*/`
`27`	`27`	`@Default`
`28`		`-public class ArrayCircularQueue<T> implements Queue<T>, Iterable<T> {`
	`28`	`+public class CircularArrayQueue<T> implements Queue<T>, Iterable<T> {`
`29`	`29`
`30`	`30`	`private T[] items;`
`31`	`31`	`private int capacity;`
`@@ -38,7 +38,7 @@ public class ArrayCircularQueue<T> implements Queue<T>, Iterable<T> {`
`38`	`38`	`private int start;`
`39`	`39`	`private int size;`
`40`	`40`
`41`		`- public ArrayCircularQueue(int m) {`
	`41`	`+ public CircularArrayQueue(int m) {`
`42`	`42`	`capacity = m;`
`43`	`43`	`items = (T[]) new Object[capacity];`
`44`	`44`	`start = 0;`

File renamed without changes.

Lines changed: 3 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,11 @@`
`1`	`1`	`package ir.sk.adt.queue;`
`2`	`2`
`3`		`-import ir.sk.adt.queue.circularqueue.ArrayCircularQueue;`
`4`	`3`	`import org.junit.After;`
`5`	`4`	`import org.junit.Before;`
`6`	`5`	`import org.junit.Test;`
`7`	`6`
	`7`	`+import ir.sk.adt.queue.circulararrayqueue.CircularArrayQueue;`
	`8`	`+`
`8`	`9`	`public class ArrayCircularQueueTest {`
`9`	`10`
`10`	`11`	`@Before`
`@@ -17,7 +18,7 @@ public void tearDown() throws Exception {`
`17`	`18`
`18`	`19`	`@Test`
`19`	`20`	`public void enqueue() {`
`20`		`- ArrayCircularQueue<Integer> c = new ArrayCircularQueue<>(10);`
	`21`	`+ CircularArrayQueue<Integer> c = new CircularArrayQueue<>(10);`
`21`	`22`	`for (int i = 0; i < 10; i++) {`
`22`	`23`	`c.enqueue(i);`
`23`	`24`	`}`

Comments

(0)