Merge pull request #54 from sustech-cs304/backend

Backend

Author: Jaredanwolfgang

backend/test/test_data_generation.py

@@ -218,7 +218,8 @@ def generate_random_bookmarklist(material_id, user_id):
 Note_id_list = []
 Code_snippet_id_list = []
 Bookmarklist_id_list = []
-File_id_list = []
+File_id_list_individual = []
+File_id_list_group = []
 Assignment_id_list = []
 Envrionment_id_list = []
 
@@ -506,13 +507,38 @@ def test_create_file():
         assert response.status_code == 200 or response.status_code == 201
         data = response.json()
         assert "file_id" in data
-        File_id_list.append(data["file_id"])
+        File_id_list_individual.append(data["file_id"])
+        assert data["message"] == "File created successfully"
+        
+    files_path_group = [
+        os.path.join(os.path.dirname(__file__), "./test_group_environment/dijkstra.py"),
+        os.path.join(os.path.dirname(__file__), "./test_group_environment/README.md"),
+    ]
+    
+    for file_path in files_path_group:
+        assert os.path.exists(file_path), "Sample PDF file does not exist."
+        with open(file_path, "rb") as f:
+            files = {"file": (os.path.basename(file_path), f, "application/pdf")}
+            data = {
+                "file_name": os.path.basename(file_path),
+                "file_path": "/code" if file_path.endswith(".py") else "/",
+            }
+            response = client.post(
+                "/api/file",
+                headers=headers,
+                data=data,
+                files=files,
+            )
+        assert response.status_code == 200 or response.status_code == 201
+        data = response.json()
+        assert "file_id" in data
+        File_id_list_group.append(data["file_id"])
         assert data["message"] == "File created successfully"
 
 def test_update_file():
     headers = {"Authorization": f"Bearer {Teacher_id_list[0]['token']}"}
     update_resp = client.put(
-        f"/api/file/{File_id_list[3]}",
+        f"/api/file/{File_id_list_individual[3]}",
         headers=headers,
         data={
             "file_name": "hello_world.py",
@@ -521,14 +547,14 @@ def test_update_file():
     )
     updated_file = update_resp.json()
     assert update_resp.status_code == 200
-    assert updated_file["file_id"] == File_id_list[3]
+    assert updated_file["file_id"] == File_id_list_individual[3]
     assert updated_file["file_name"] == "hello_world.py"
     assert updated_file["file_path"] == "/test_code_files"
 
 def test_delete_file():
     headers = {"Authorization": f"Bearer {Teacher_id_list[0]['token']}"}
     delete_resp = client.delete(
-        f"/api/file/{File_id_list[2]}",
+        f"/api/file/{File_id_list_individual[2]}",
         headers=headers,
     )
     assert delete_resp.status_code == 200
@@ -542,9 +568,9 @@ def test_create_assignment():
         "course_id": Course_id_list[0],
         "name": "Homework 1",
         "description": "This is the first homework assignment.",
-        "deadline": "2025-06-01 23:59:59",
+        "deadline": "2025-06-03 23:59:59",
         "is_group_assign": False,
-        "files": File_id_list,
+        "files": File_id_list_individual,
     }
     response = client.post("/api/assignment", data=assignment_data, headers=headers)
     assert response.status_code == 200 or response.status_code == 201
@@ -553,6 +579,21 @@ def test_create_assignment():
     Assignment_id_list.append(data["assignment_id"])
     assert data["message"] == "Assignment created successfully."
 
+    assignment_data2 = {
+        "course_id": Course_id_list[0],
+        "name": "Group Project",
+        "description": "This is a group project assignment.",
+        "deadline": "2025-06-15 23:59:59",
+        "is_group_assign": True,
+        "files": File_id_list_group,
+    }
+    response2 = client.post("/api/assignment", data=assignment_data2, headers=headers)
+    assert response2.status_code == 200 or response2.status_code == 201
+    data2 = response2.json()
+    assert "assignment_id" in data2
+    Assignment_id_list.append(data2["assignment_id"])
+    assert data2["message"] == "Assignment created successfully."
+    
 def test_get_assignments():
     student_token = Student_id_list[0]["token"]
     headers = {"Authorization": f"Bearer {student_token}"}

backend/test/test_group_environment/README.md

@@ -0,0 +1,55 @@
+# Dijkstra Project Description
+
+## Overview
+
+This project implements **Dijkstra's Algorithm** for finding the shortest path in a weighted graph. Dijkstra's Algorithm is a classic solution in computer science for solving the single-source shortest path problem, where the goal is to determine the minimum distance from a starting node to all other nodes in a graph with non-negative edge weights.
+
+## Features
+
+- **Graph Representation:** Supports both adjacency list and adjacency matrix representations.
+- **Customizable Input:** Users can define their own graphs and specify the source node.
+- **Efficient Implementation:** Utilizes a priority queue (min-heap) for optimal performance.
+- **Path Reconstruction:** Returns both the shortest distances and the actual paths taken.
+- **Error Handling:** Handles disconnected graphs and invalid input gracefully.
+
+## How It Works
+
+1. **Initialization:**  
+   All node distances are set to infinity except the source node, which is set to zero.
+
+2. **Processing:**  
+   The algorithm repeatedly selects the node with the smallest known distance, updates the distances to its neighbors, and continues until all nodes have been processed.
+
+3. **Result:**  
+   The shortest path from the source to every other node is computed and can be retrieved.
+
+## Applications
+
+- Network routing protocols (e.g., OSPF)
+- GPS navigation systems
+- Robotics and AI pathfinding
+- Project scheduling and resource allocation
+
+## Example Usage
+
+```python
+# Example usage in Python
+graph = {
+    'A': {'B': 1, 'C': 4},
+    'B': {'C': 2, 'D': 5},
+    'C': {'D': 1},
+    'D': {}
+}
+distances, paths = dijkstra(graph, 'A')
+print(distances)  # {'A': 0, 'B': 1, 'C': 3, 'D': 4}
+print(paths)      # {'A': ['A'], 'B': ['A', 'B'], ...}
+```
+
+## References
+
+- [Dijkstra's Algorithm - Wikipedia](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
+- [Introduction to Algorithms, Cormen et al.]
+
+---
+
+*This project demonstrates a fundamental algorithm used in many real-world applications, emphasizing both correctness and efficiency.*

backend/test/test_group_environment/dijkstra.py

@@ -0,0 +1,46 @@
+import heapq
+
+"""
+Demonstrative Python file for a group algorithm project.
+Implements Dijkstra's algorithm for finding the shortest path in a graph.
+"""
+
+
+def dijkstra(graph, start):
+    """
+    Finds the shortest paths from start node to all other nodes in the graph.
+    :param graph: dict, adjacency list representation {node: [(neighbor, weight), ...]}
+    :param start: starting node
+    :return: dict, shortest distances to each node
+    """
+    distances = {node: float('inf') for node in graph}
+    distances[start] = 0
+    queue = [(0, start)]
+
+    while queue:
+        current_distance, current_node = heapq.heappop(queue)
+        if current_distance > distances[current_node]:
+            continue
+        for neighbor, weight in graph[current_node]:
+            distance = current_distance + weight
+            if distance < distances[neighbor]:
+                distances[neighbor] = distance
+                heapq.heappush(queue, (distance, neighbor))
+    return distances
+
+def main():
+    # Example graph
+    graph = {
+        'A': [('B', 1), ('C', 4)],
+        'B': [('A', 1), ('C', 2), ('D', 5)],
+        'C': [('A', 4), ('B', 2), ('D', 1)],
+        'D': [('B', 5), ('C', 1)]
+    }
+    start_node = 'A'
+    print(f"Shortest distances from {start_node}:")
+    distances = dijkstra(graph, start_node)
+    for node, distance in distances.items():
+        print(f"  {node}: {distance}")
+
+if __name__ == "__main__":
+    main()