package names should start wıth lowercase letters

src/Main.java

@@ -1,9 +1,9 @@
-import Algorithms.InitializeNodePositions;
-import Algorithms.RandomGraphGenerator;
-import Algorithms.SweepCrossingMinimizer;
-import IO.Reader;
-import Model.LayeredGraphNode;
-import View.MainView;
+import algorithms.InitializeNodePositions;
+import algorithms.RandomGraphGenerator;
+import algorithms.SweepCrossingMinimizer;
+import io.Reader;
+import model.LayeredGraphNode;
+import view.MainView;
 
 /**
  * The main executable class. Starts the application.

src/Algorithms/InitializeNodePositions.java → src/algorithms/InitializeNodePositions.java

@@ -1,9 +1,9 @@
-package Algorithms;
+package algorithms;
 
 import java.util.ArrayList;
 
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
-import Model.LayeredGraphNode;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
+import model.LayeredGraphNode;
 
 
 /**

src/Algorithms/RandomColorGenerator.java → src/algorithms/RandomColorGenerator.java

@@ -1,4 +1,4 @@
-package Algorithms;
+package algorithms;
 
 import java.awt.Color;
 import java.util.Random;

src/Algorithms/RandomGraphGenerator.java → src/algorithms/RandomGraphGenerator.java

@@ -1,7 +1,7 @@
-package Algorithms;
+package algorithms;
 
-import Model.LayeredGraphNode;
-import Model.LayeredNode;
+import model.LayeredGraphNode;
+import model.LayeredNode;
 
 /**
  * creates random {@link LayeredGraphNode}s for testing purposes

src/Algorithms/SweepCrossingMinimizer.java → src/algorithms/SweepCrossingMinimizer.java

@@ -1,9 +1,9 @@
-package Algorithms;
+package algorithms;
 
 import java.util.ArrayList;
 
-import Model.LayeredGraphEdge;
-import Model.LayeredGraphNode;
+import model.LayeredGraphEdge;
+import model.LayeredGraphNode;
 
 
 /**

src/Algorithms/Animated/Action.java → src/algorithms/animated/Action.java

@@ -1,4 +1,4 @@
-package Algorithms.Animated;
+package algorithms.animated;
 
 /**
  * An action some kind of command that can be send to the {@link AnimatedAlgorithm} from the {@link AnimationController}.

src/Algorithms/Animated/AlgorithmStage.java → src/algorithms/animated/AlgorithmStage.java

@@ -1,6 +1,6 @@
-package Algorithms.Animated;
+package algorithms.animated;
 
-import Algorithms.Animated.BK.BlockCalc;
+import algorithms.animated.bk.BlockCalc;
 
 /**
  * Represents a specific stage of the algorithm.

src/Algorithms/Animated/AnimatedAlgorithm.java → src/algorithms/animated/AnimatedAlgorithm.java

@@ -1,6 +1,6 @@
-package Algorithms.Animated;
+package algorithms.animated;
 
-import Model.LayeredGraphNode;
+import model.LayeredGraphNode;
 
 public abstract class AnimatedAlgorithm extends Thread implements AlgorithmStage {
 

src/Algorithms/Animated/AnimationController.java → src/algorithms/animated/AnimationController.java

@@ -1,4 +1,4 @@
-package Algorithms.Animated;
+package algorithms.animated;
 
 public class AnimationController {
 	

src/Algorithms/Animated/BackwardAction.java → src/algorithms/animated/BackwardAction.java

@@ -1,4 +1,4 @@
-package Algorithms.Animated;
+package algorithms.animated;
 
 /**
  * An action that reverts another Action.

src/Algorithms/Animated/BK/BKNodePlacement.java → src/algorithms/animated/bk/BKNodePlacement.java

@@ -1,9 +1,9 @@
-package Algorithms.Animated.BK;
+package algorithms.animated.bk;
 
-import Algorithms.Animated.AlgorithmStage;
-import Algorithms.Animated.AnimatedAlgorithm;
-import Algorithms.Animated.AnimationController;
-import Model.LayeredGraphNode;
+import algorithms.animated.AlgorithmStage;
+import algorithms.animated.AnimatedAlgorithm;
+import algorithms.animated.AnimationController;
+import model.LayeredGraphNode;
 
 /**
  * The main stage of the BK node placement algorithm.

src/Algorithms/Animated/BK/BlockCalc.java → src/algorithms/animated/bk/BlockCalc.java

@@ -1,14 +1,14 @@
-package Algorithms.Animated.BK;
+package algorithms.animated.bk;
 
 import java.awt.Color;
 import java.util.ArrayList;
 import java.util.Collections;
 
-import Algorithms.Animated.AlgorithmStage;
-import Algorithms.Animated.BackwardAction;
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
-import Model.LayeredGraphEdge;
-import Model.LayeredGraphNode;
+import algorithms.animated.AlgorithmStage;
+import algorithms.animated.BackwardAction;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
+import model.LayeredGraphEdge;
+import model.LayeredGraphNode;
 
 /**
  * The stage of the BK node placement algorithm where the blocks are computed.

src/Algorithms/Animated/BK/Combine.java → src/algorithms/animated/bk/Combine.java

@@ -1,7 +1,7 @@
-package Algorithms.Animated.BK;
+package algorithms.animated.bk;
 
-import Algorithms.Animated.AlgorithmStage;
-import Model.LayeredGraphNode;
+import algorithms.animated.AlgorithmStage;
+import model.LayeredGraphNode;
 
 /**
  * The stage of the combination of the four extremal layouts.

src/Algorithms/Animated/BK/Compaction.java → src/algorithms/animated/bk/Compaction.java

@@ -1,11 +1,11 @@
-package Algorithms.Animated.BK;
+package algorithms.animated.bk;
 
 import java.util.ArrayList;
 
-import Algorithms.Animated.AlgorithmStage;
-import Algorithms.Animated.BackwardAction;
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
-import Model.LayeredGraphNode;
+import algorithms.animated.AlgorithmStage;
+import algorithms.animated.BackwardAction;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
+import model.LayeredGraphNode;
 
 /**
  * The stage of compacting the layout.

src/Algorithms/Animated/BK/ConflictDetection.java → src/algorithms/animated/bk/ConflictDetection.java

@@ -1,11 +1,11 @@
-package Algorithms.Animated.BK;
+package algorithms.animated.bk;
 
 import java.util.ArrayList;
 
-import Algorithms.Animated.AlgorithmStage;
-import Algorithms.Animated.BackwardAction;
-import Model.LayeredGraphEdge;
-import Model.LayeredGraphNode;
+import algorithms.animated.AlgorithmStage;
+import algorithms.animated.BackwardAction;
+import model.LayeredGraphEdge;
+import model.LayeredGraphNode;
 
 public class ConflictDetection implements AlgorithmStage {
 

src/Algorithms/Animated/BK/ExtremalLayoutCalc.java → src/algorithms/animated/bk/ExtremalLayoutCalc.java

@@ -1,7 +1,7 @@
-package Algorithms.Animated.BK;
+package algorithms.animated.bk;
 
-import Algorithms.Animated.AlgorithmStage;
-import Model.LayeredGraphNode;
+import algorithms.animated.AlgorithmStage;
+import model.LayeredGraphNode;
 
 /**
  * The stage where the for extremal layouts are computed.

src/IO/Reader.java → src/io/Reader.java

@@ -1,4 +1,4 @@
-package IO;
+package io;
 
 import java.io.BufferedReader;
 import java.io.FileReader;
@@ -9,9 +9,9 @@ import org.json.JSONArray;
 import org.json.JSONException;
 import org.json.JSONObject;
 
-import Model.LayeredGraphEdge;
-import Model.LayeredGraphNode;
-import Model.LayeredNode;
+import model.LayeredGraphEdge;
+import model.LayeredGraphNode;
+import model.LayeredNode;
 
 /**
  * reads a {@link LayeredGraphNode} from a JSON file

src/IO/Writer.java → src/io/Writer.java

@@ -1,4 +1,4 @@
-package IO;
+package io;
 
 import java.io.BufferedWriter;
 import java.io.FileWriter;
@@ -9,8 +9,8 @@ import org.json.JSONArray;
 import org.json.JSONException;
 import org.json.JSONObject;
 
-import Model.LayeredGraphEdge;
-import Model.LayeredGraphNode;
+import model.LayeredGraphEdge;
+import model.LayeredGraphNode;
 
 /**
  * Writes a {@link LayeredGraphNode} to a JSON file.

src/Model/LayeredEdge.java → src/model/LayeredEdge.java

@@ -1,11 +1,11 @@
-package Model;
+package model;
 
 import java.awt.Point;
 import java.util.ArrayList;
 
 import org.eclipse.elk.graph.ElkEdge;
 
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
 
 /**
  * Die Implementation einer Kante aus einem Layered Graphen.

src/Model/LayeredGraphEdge.java → src/model/LayeredGraphEdge.java

@@ -1,11 +1,11 @@
- package Model;
+ package model;
 
 import java.awt.Point;
 import java.util.ArrayList;
 
 import org.eclipse.elk.graph.ElkEdge;
 
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
 
 /**
  * Ein Interface, welches die Methoden einer Kante aus einem gelayerten Graphen beschreibt

src/Model/LayeredGraphNode.java → src/model/LayeredGraphNode.java

@@ -1,4 +1,4 @@
-package Model;
+package model;
 
 import java.awt.Color;
 import java.util.ArrayList;
@@ -6,7 +6,7 @@ import java.util.ArrayList;
 import org.eclipse.elk.graph.ElkEdge;
 import org.eclipse.elk.graph.ElkNode;
 
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
 
 /**
  * Ein Interface, welches die Methoden eines Knotens aus einem gelayerten Graphen beschreibt (Ein Knoten kann dabei auch einen weiteren Graphen beinhalten)

src/Model/LayeredNode.java → src/model/LayeredNode.java

@@ -1,4 +1,4 @@
-package Model;
+package model;
 
 import java.awt.Color;
 import java.util.ArrayList;
@@ -8,8 +8,8 @@ import javax.swing.SwingUtilities;
 import org.eclipse.elk.graph.ElkEdge;
 import org.eclipse.elk.graph.ElkNode;
 
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
-import View.MainView;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
+import view.MainView;
 
 /**
  * Die Implementation eines Knotens in einem Layered Graph.

src/View/EdgeView.java → src/view/EdgeView.java

@@ -1,4 +1,4 @@
-package View;
+package view;
 
 import java.awt.BasicStroke;
 import java.awt.Color;
@@ -10,8 +10,8 @@ import java.util.ArrayList;
 
 import javax.swing.JPanel;
 
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
-import Model.LayeredGraphEdge;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
+import model.LayeredGraphEdge;
 
 /**
  * A drawable representation of an edge.

src/View/MainView.java → src/view/MainView.java

@@ -1,4 +1,4 @@
-package View;
+package view;
 
 import java.awt.Component;
 import java.awt.GridLayout;
@@ -12,13 +12,13 @@ import javax.swing.JFrame;
 import javax.swing.JLayeredPane;
 import javax.swing.JPanel;
 
-import Algorithms.Animated.Action;
-import Algorithms.Animated.AnimationController;
-import Algorithms.Animated.BK.BKNodePlacement;
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
-import IO.Writer;
-import Model.LayeredGraphEdge;
-import Model.LayeredGraphNode;
+import algorithms.animated.Action;
+import algorithms.animated.AnimationController;
+import algorithms.animated.bk.BKNodePlacement;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
+import io.Writer;
+import model.LayeredGraphEdge;
+import model.LayeredGraphNode;
 
 /**
  * The main window of the application.

src/View/NodeView.java → src/view/NodeView.java

@@ -1,4 +1,4 @@
-package View;
+package view;
 
 import java.awt.BasicStroke;
 import java.awt.Color;
@@ -11,8 +11,8 @@ import java.awt.Point;
 import javax.swing.*;
 import javax.swing.border.Border;
 
-import Algorithms.Animated.BK.ExtremalLayoutCalc.LayoutType;
-import Model.LayeredGraphNode;
+import algorithms.animated.bk.ExtremalLayoutCalc.LayoutType;
+import model.LayeredGraphNode;
 
 /**
  * A drawable representation of a node.

src/View/RenderHelper.java → src/view/RenderHelper.java

@@ -1,4 +1,4 @@
-package View;
+package view;
 
 import java.awt.Point;
 import java.awt.Polygon;