01204212/friends - ประวัติรุ่นแก้ไข

Jittat: /* Code */

2016-12-01T06:40:12Z

Code

Jittat: /* Tasks 3 */

2016-11-30T15:51:54Z

Tasks 3

Jittat: /* Tasks 2 */

2016-11-30T15:49:50Z

Tasks 2

Jittat เมื่อ 15:41, 30 พฤศจิกายน 2559

2016-11-30T15:41:00Z

Jittat เมื่อ 15:30, 30 พฤศจิกายน 2559

2016-11-30T15:30:30Z

Jittat: /* Code */

2016-11-30T15:10:00Z

Code

Jittat: /* Code */

2016-11-23T23:44:54Z

Code

Jittat: หน้าที่ถูกสร้างด้วย ': ''This part of 01204212'' == Code == import java.io.BufferedReader; import java.io.InputStreamRead...'

2016-11-23T23:43:59Z

หน้าที่ถูกสร้างด้วย ': ''This part of 01204212'' == Code == <syntaxhighlight lang="java"> import java.io.BufferedReader; import java.io.InputStreamRead...'

หน้าใหม่

: ''This part of [[01204212]]''

== Code ==
<syntaxhighlight lang="java">
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Main {

public static void main(String[] args) {
Main main = new Main();

main.process();
}

int n,m;
List<Integer> [] adjList;

void process() {
readInput();
}

private void readInput() {
BufferedReader reader = new BufferedReader(
new InputStreamReader(System.in) );

try {
String[] items = reader.readLine().split(" ");

n = Integer.parseInt(items[0]);
m = Integer.parseInt(items[1]);

adjList = (List<Integer>[])(new List[n]);
for(int i=0; i<n; i++) {
adjList[i] = new ArrayList<Integer>();
}

for(int i=0; i<m; i++) {
items = reader.readLine().split(" ");
int u = Integer.parseInt(items[0]) - 1;
int v = Integer.parseInt(items[1]) - 1;

adjList[u].add(v);
adjList[v].add(u);
}
} catch(Exception e) {
}
}
}
</syntaxhighlight>

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 15:51, 30 พฤศจิกายน 2559
แถว 18:		แถว 18:

	== Tasks 3 ==		== Tasks 3 ==
		+	In twitter graph, find out how many vertices that are reachable from vertex 0 but vertex 0 cannot be reachable from them.

	== Code ==		== Code ==

@@ แถว 16: / แถว 16: @@
 == Tasks 2 ==
 Consider vertex 0 and vertex ''n''-1.  Find the length of the shortest path from vertex 0 to vertex ''n''-1.
 == Code ==

@@ แถว 3: / แถว 3: @@
 In this task you will work with graphs from real social networks.
-* facebook.in -- This is a graph from facebook.  It is an undirected graph.  The graph is from [https://snap.stanford.edu/data/egonets-Facebook.html]
+* [http://theory.cpe.ku.ac.th/~jittat/courses/01204212/tasks/graph1/facebook.in facebook.in] -- This is a graph from facebook.  It is an undirected graph.  The graph is from [https://snap.stanford.edu/data/egonets-Facebook.html].  It has 4,039 vertices and 88,234 edges.
-* twitter.in -- This is a graph from twitter.  It is a directed graph.  This graph is from [https://snap.stanford.edu/data/egonets-Twitter.html]
+* [http://theory.cpe.ku.ac.th/~jittat/courses/01204212/tasks/graph1/twitter.in twitter.in] -- This is a graph from twitter.  It is a directed graph.  This graph is from [https://snap.stanford.edu/data/egonets-Twitter.html]. It has 81,306 vertices and 1,768,149 edges.
 '''The graph format:'''
@@ แถว 11: / แถว 11: @@
 * Next ''m'' lines: each line contains two integers ''u'' and ''v'' (ranging from 0 to n-1).  In an undirected graph, this means that there is an edge between ''u'' and ''v''.  In a directed graph, this means that there is an edge from ''u'' to ''v''.
-== Tasks ==
+== Tasks 1 ==
 == Code ==

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 15:30, 30 พฤศจิกายน 2559
แถว 1:		แถว 1:
	: ''This part of [[01204212]]''		: ''This part of [[01204212]]''
		+
		+	In this task you will work with graphs from real social networks.
		+
		+	* facebook.in -- This is a graph from facebook. It is an undirected graph. The graph is from [https://snap.stanford.edu/data/egonets-Facebook.html]
		+	* twitter.in -- This is a graph from twitter. It is a directed graph. This graph is from [https://snap.stanford.edu/data/egonets-Twitter.html]
		+
		+	'''The graph format:'''
		+
		+	* First line: two integers ''n'' and ''m'', where ''n'' is the number of vertices and ''m'' is the number of edges
		+	* Next ''m'' lines: each line contains two integers ''u'' and ''v'' (ranging from 0 to n-1). In an undirected graph, this means that there is an edge between ''u'' and ''v''. In a directed graph, this means that there is an edge from ''u'' to ''v''.
		+
		+	== Tasks ==

	== Code ==		== Code ==

@@ แถว 69: / แถว 69: @@
+     }
+}
 </syntaxhighlight>

@@ แถว 40: / แถว 40: @@
              for(int i=0; i<m; i++) {
                  items = reader.readLine().split(" ");
-                 int u = Integer.parseInt(items[0]) - 1;
+                 int u = Integer.parseInt(items[0]);
-                 int v = Integer.parseInt(items[1]) - 1;
+                 int v = Integer.parseInt(items[1]);
                  adjList[u].add(v);

@@ แถว 10: / แถว 10: @@
 public class Main {
-	public static void main(String[] args) {
+    public static void main(String[] args) {
-		Main main = new Main();
+        Main main = new Main();
-−
-		main.process();
+        main.process();
-−
+    }
-−
-	int n,m;
+    int n,m;
-	List<Integer> [] adjList;
+    List<Integer> [] adjList;
-−
-	void process() {
+    void process() {
-		readInput();
+        readInput();
-−
+    }
-	private void readInput() {
+    private void readInput() {
-	    BufferedReader reader = new BufferedReader(
+        BufferedReader reader = new BufferedReader(
-	               new InputStreamReader(System.in) );
+                   new InputStreamReader(System.in) );
-	    try {
+        try {
-	    	String[] items = reader.readLine().split(" ");
+            String[] items = reader.readLine().split(" ");
-	    	n = Integer.parseInt(items[0]);
+            n = Integer.parseInt(items[0]);
-	    	m = Integer.parseInt(items[1]);
+            m = Integer.parseInt(items[1]);
-	    	adjList = (List<Integer>[])(new List[n]);
+            adjList = (List<Integer>[])(new List[n]);
-	    	for(int i=0; i<n; i++) {
+            for(int i=0; i<n; i++) {
-	    		adjList[i] = new ArrayList<Integer>();
+                adjList[i] = new ArrayList<Integer>();
-−
+            }
-−
-	    	for(int i=0; i<m; i++) {
+            for(int i=0; i<m; i++) {
-	    		items = reader.readLine().split(" ");
+                items = reader.readLine().split(" ");
-	    		int u = Integer.parseInt(items[0]) - 1;
+                int u = Integer.parseInt(items[0]) - 1;
-	    		int v = Integer.parseInt(items[1]) - 1;
+                int v = Integer.parseInt(items[1]) - 1;
-−
-	    		adjList[u].add(v);
+                adjList[u].add(v);
-	    		adjList[v].add(u);
+                adjList[v].add(u);
-−
+            }
-	    } catch(Exception e) {
+        } catch(Exception e) {
-−
+        }
-−
+    }
+}
 </syntaxhighlight>