network algorithms

Author: bzdgn

README.md

@@ -1 +1,7 @@
-"# data-structures-in-java" 
+ToDo's:
+*******
+- Appendix will be crated in this Readme file
+- DS_011 Package: BTree implementation will be completed
+- DS_011 Package: AVLTree implementation will be completed
+- DS_012 Package: Knight's Tour is going to be demonstrated
+- DS_013 Package: Graphs are going to be completed

src/ds_013_network_algorithms/network-algorithms-notes.txt

@@ -0,0 +1,64 @@
+TERMINOLOGY
+***********
+Network / Graph         A set of nodes connected by links
+Node / Vertex           A spot in a network
+Link / Edge             Connects nodes, can be either directed or indirected
+Path                    A sequence of nodes and links
+Cycle / Loop            A path that returns to its starting point
+Reachable               B is reachable from A if there is a path from A to B
+Connected               Nodes A and B are connected if B is reachable from A and vice versa
+Undirected              A graph is connected if every node is connected to every other node
+Strongly Connected      If every node in a graph is reachable from every other node
+Weakly Connected        A directed network becomes connected when you replace its links with undirected links
+Adjacent                Nodes are connected by a link
+Neighbor                An adjacent node
+
+Example;
+
+A ---- 75 ----> B
+
+Node A and Node B are connected by a link so they are adjacent nodes.
+Node B is Node A's neighbor because there is a directed link from Node A
+to Node B however, Node A is not neighbor of Node B because there is not a
+backward directed link from Node B to Node A. If the graph was undirected,
+then both Nodes would be neighbors of each other.
+
+Degree                 In an undirected network, he number of links a node has is called Degree.
+In-Degree              In a directed network, the number of links entering a node is called In-Degree.
+Out-Degree             Same as In-Degree but Out-Degree is the number of links leaving the node.
+
+
+NETWORK REPRESENTATION
+**********************
+You can save network in a text file in order to reuse it. Check out following directed graph;
+
+      A
+     / \
+    /   \
+  10     15
+  /        \
+|/_        _\|
+
+B --- 12 --> C
+ \          /
+  \        /
+  16     13
+    \   /
+    _\|/_
+      D
+
+To save it to a text file, you can use following format;
+
+nodeLabel, toNode#1, cost#1, toNode#2, cost#2,... toNode#N, cost#N
+
+So, the text representation will be as follows;
+
+A, B, 10, C, 15
+B, C, 12, D, 16
+C, D, 13
+D
+
+Other Representations;
+**********************
+XML
+JSON

src/ds_013_network_algorithms/sampleClasses/DirectedLinkExampleClass.java

@@ -0,0 +1,12 @@
+package ds_013_network_algorithms.sampleClasses;
+
+public class DirectedLinkExampleClass {
+	
+	private Integer cost;
+	private DirectedNodeExampleClass toNode;
+	
+	public DirectedLinkExampleClass(Integer cost) {
+		this.cost = cost;
+	}
+	
+}

src/ds_013_network_algorithms/sampleClasses/DirectedNodeExampleClass.java

@@ -0,0 +1,16 @@
+package ds_013_network_algorithms.sampleClasses;
+
+import java.util.LinkedList;
+import java.util.List;
+
+public class DirectedNodeExampleClass {
+	
+	private final String label;
+	private List<DirectedLinkExampleClass> links;
+	
+	public DirectedNodeExampleClass(String label) {
+		this.label = label;
+		this.links = new LinkedList<>();
+	}
+
+}

src/ds_013_network_algorithms/sampleClasses/EnhancedDirectedLinkExampleClass.java

@@ -0,0 +1,13 @@
+package ds_013_network_algorithms.sampleClasses;
+
+public class EnhancedDirectedLinkExampleClass {
+	
+	private Integer cost;
+	private DirectedNodeExampleClass fromNode;
+	private DirectedNodeExampleClass toNode;
+	
+	public EnhancedDirectedLinkExampleClass(Integer cost) {
+		this.cost = cost;
+	}
+	
+}

src/ds_013_network_algorithms/sampleClasses/EnhancedDirectedNodeExampleClass.java

@@ -0,0 +1,18 @@
+package ds_013_network_algorithms.sampleClasses;
+
+import java.util.LinkedList;
+import java.util.List;
+
+public class EnhancedDirectedNodeExampleClass {
+	
+	private final String label;
+	private List<EnhancedDirectedLinkExampleClass> inLinks;
+	private List<EnhancedDirectedLinkExampleClass> outLinks;
+	
+	public EnhancedDirectedNodeExampleClass(String label) {
+		this.label = label;
+		this.inLinks = new LinkedList<>();
+		this.outLinks = new LinkedList<>();
+	}
+
+}

src/ds_013_network_algorithms/sampleClasses/SimpleNodeClassExample.java

@@ -0,0 +1,20 @@
+package ds_013_network_algorithms.sampleClasses;
+
+import java.util.LinkedList;
+import java.util.List;
+
+public class SimpleNodeClassExample {
+	
+	private final String label;
+	private final List<SimpleNodeClassExample> neighbors;
+	private final List<Integer> costs;
+	private boolean visited;
+	
+	public SimpleNodeClassExample(String label) {
+		this.label = label;
+		this.neighbors = new LinkedList<>();
+		this.costs = new LinkedList<>();
+		this.visited = false;
+	}
+	
+}

src/ds_013_network_algorithms/sampleClasses/UndirectedLinkExampleClass.java

@@ -0,0 +1,13 @@
+package ds_013_network_algorithms.sampleClasses;
+
+public class UndirectedLinkExampleClass {
+	
+	private Integer cost;
+	private DirectedNodeExampleClass[] nodes;
+	
+	public UndirectedLinkExampleClass(Integer cost) {
+		this.cost = cost;
+		this.nodes = new DirectedNodeExampleClass[2];
+	}
+	
+}

src/ds_013_network_algorithms/sampleClasses/UndirectedNodeExampleClass.java

@@ -0,0 +1,16 @@
+package ds_013_network_algorithms.sampleClasses;
+
+import java.util.LinkedList;
+import java.util.List;
+
+public class UndirectedNodeExampleClass {
+	
+	private final String label;
+	private List<UndirectedLinkExampleClass> links;
+	
+	public UndirectedNodeExampleClass(String label) {
+		this.label = label;
+		this.links = new LinkedList<>();
+	}
+
+}