From e8566c7ff843a6bba623bc3178d488dec8af9aca Mon Sep 17 00:00:00 2001 From: SrijaVuppala295 Date: Fri, 1 Nov 2024 21:30:51 +0530 Subject: [PATCH 1/3] done --- .../realworld/realworld.component.ts | 63 +++++++++++++++---- 1 file changed, 50 insertions(+), 13 deletions(-) diff --git a/src/app/components/realworld/realworld.component.ts b/src/app/components/realworld/realworld.component.ts index 1dfb1393..1ae26863 100644 --- a/src/app/components/realworld/realworld.component.ts +++ b/src/app/components/realworld/realworld.component.ts @@ -24,42 +24,79 @@ export class RealworldComponent implements OnInit { { id: 1, title: 'Social Networks', - description: 'Graph theory is used to analyze social networks, where nodes represent individuals and edges represent relationships or interactions.', + description: 'Graph algorithms analyze social networks, where nodes represent individuals and edges represent relationships or interactions.', icon: '👥', category: 'Technology', details: [ - 'Identify influential users or communities', - 'Analyze information spread and viral content', - 'Detect patterns in user behavior and connections' + 'Use algorithms like BFS and DFS to explore connections', + 'Identify influential users using centrality algorithms', + 'Detect communities through clustering algorithms' ] }, { id: 2, title: 'Transportation Systems', - description: 'Graphs model road networks, flight paths, and public transit systems, optimizing routes and traffic flow.', + description: 'Graphs model road networks, flight paths, and public transit systems, with algorithms optimizing routes and traffic flow.', icon: '🚗', category: 'Infrastructure', details: [ - 'Optimize traffic light timing', - 'Plan efficient public transportation routes', - 'Analyze and improve road network connectivity' + 'Apply Dijkstra’s algorithm for shortest path finding', + 'Use Floyd-Warshall for all-pairs shortest paths in network analysis', + 'Optimize traffic flow with minimum spanning tree algorithms' ] }, { id: 3, title: 'Computer Networks', - description: 'Network topologies and data routing algorithms rely heavily on graph theory concepts.', + description: 'Network routing algorithms utilize graph theory to manage data flow in computer networks.', icon: '💻', category: 'Technology', details: [ - 'Design efficient network architectures', - 'Implement routing protocols', - 'Analyze network vulnerability and security' + 'Implement Dijkstra’s algorithm for efficient packet routing', + 'Use Bellman-Ford for networks with negative weights', + 'Analyze network resilience and redundancy with connectivity algorithms' + ] + }, + { + id: 4, + title: 'Web Crawling', + description: 'Graph traversal algorithms help search engines efficiently crawl web pages and index content.', + icon: '🌐', + category: 'Technology', + details: [ + 'Use BFS for level-order web crawling', + 'Prioritize high-value sites with DFS-based techniques', + 'Identify page ranking through graph-based link analysis algorithms' + ] + }, + { + id: 5, + title: 'Scheduling and Task Dependency', + description: 'Graphs represent tasks and dependencies in scheduling applications, ensuring efficient task management.', + icon: '📅', + category: 'Management', + details: [ + 'Use topological sorting for task ordering in dependency graphs', + 'Detect circular dependencies with cycle detection algorithms', + 'Optimize task scheduling with DAG (Directed Acyclic Graph) structures' + ] + }, + { + id: 6, + title: 'Game Development', + description: 'Graphs are used to model game maps, paths, and character movements in gaming algorithms.', + icon: '🎮', + category: 'Entertainment', + details: [ + 'Implement A* algorithm for pathfinding in open-world games', + 'Design maze generation and traversal with DFS and BFS', + 'Model game states and transitions with graph-based structures' ] } + ]; - categories: string[] = ['All', 'Technology', 'Infrastructure']; + categories: string[] = ['All', 'Technology', 'Infrastructure', 'Management','Entertainment']; selectedCategory: string = 'All'; searchTerm: string = ''; From cc991943110575b4d56133fe9f84200f761078d2 Mon Sep 17 00:00:00 2001 From: SrijaVuppala295 Date: Fri, 1 Nov 2024 21:38:35 +0530 Subject: [PATCH 2/3] done --- .../realworld/realworld.component.css | 7 ++- .../realworld/realworld.component.ts | 63 ++++--------------- 2 files changed, 19 insertions(+), 51 deletions(-) diff --git a/src/app/components/realworld/realworld.component.css b/src/app/components/realworld/realworld.component.css index ec00ad92..f625210e 100644 --- a/src/app/components/realworld/realworld.component.css +++ b/src/app/components/realworld/realworld.component.css @@ -4,6 +4,11 @@ font-weight: 500; /* Medium weight for specific elements */ font-style: normal; /* Normal font style */ } + +*{ + margin: 0px; + padding: 0px; +} body { font-family: "Montserrat", sans-serif; /* Apply Montserrat to the body for all text */ font-weight: 400; /* Regular weight for body text */ @@ -20,7 +25,7 @@ body { max-width: 1200px; margin: 0 auto; padding: 0 2rem; - margin-top: 4rem; + margin-top: 6rem; } header { diff --git a/src/app/components/realworld/realworld.component.ts b/src/app/components/realworld/realworld.component.ts index 1ae26863..1dfb1393 100644 --- a/src/app/components/realworld/realworld.component.ts +++ b/src/app/components/realworld/realworld.component.ts @@ -24,79 +24,42 @@ export class RealworldComponent implements OnInit { { id: 1, title: 'Social Networks', - description: 'Graph algorithms analyze social networks, where nodes represent individuals and edges represent relationships or interactions.', + description: 'Graph theory is used to analyze social networks, where nodes represent individuals and edges represent relationships or interactions.', icon: '👥', category: 'Technology', details: [ - 'Use algorithms like BFS and DFS to explore connections', - 'Identify influential users using centrality algorithms', - 'Detect communities through clustering algorithms' + 'Identify influential users or communities', + 'Analyze information spread and viral content', + 'Detect patterns in user behavior and connections' ] }, { id: 2, title: 'Transportation Systems', - description: 'Graphs model road networks, flight paths, and public transit systems, with algorithms optimizing routes and traffic flow.', + description: 'Graphs model road networks, flight paths, and public transit systems, optimizing routes and traffic flow.', icon: '🚗', category: 'Infrastructure', details: [ - 'Apply Dijkstra’s algorithm for shortest path finding', - 'Use Floyd-Warshall for all-pairs shortest paths in network analysis', - 'Optimize traffic flow with minimum spanning tree algorithms' + 'Optimize traffic light timing', + 'Plan efficient public transportation routes', + 'Analyze and improve road network connectivity' ] }, { id: 3, title: 'Computer Networks', - description: 'Network routing algorithms utilize graph theory to manage data flow in computer networks.', + description: 'Network topologies and data routing algorithms rely heavily on graph theory concepts.', icon: '💻', category: 'Technology', details: [ - 'Implement Dijkstra’s algorithm for efficient packet routing', - 'Use Bellman-Ford for networks with negative weights', - 'Analyze network resilience and redundancy with connectivity algorithms' - ] - }, - { - id: 4, - title: 'Web Crawling', - description: 'Graph traversal algorithms help search engines efficiently crawl web pages and index content.', - icon: '🌐', - category: 'Technology', - details: [ - 'Use BFS for level-order web crawling', - 'Prioritize high-value sites with DFS-based techniques', - 'Identify page ranking through graph-based link analysis algorithms' - ] - }, - { - id: 5, - title: 'Scheduling and Task Dependency', - description: 'Graphs represent tasks and dependencies in scheduling applications, ensuring efficient task management.', - icon: '📅', - category: 'Management', - details: [ - 'Use topological sorting for task ordering in dependency graphs', - 'Detect circular dependencies with cycle detection algorithms', - 'Optimize task scheduling with DAG (Directed Acyclic Graph) structures' - ] - }, - { - id: 6, - title: 'Game Development', - description: 'Graphs are used to model game maps, paths, and character movements in gaming algorithms.', - icon: '🎮', - category: 'Entertainment', - details: [ - 'Implement A* algorithm for pathfinding in open-world games', - 'Design maze generation and traversal with DFS and BFS', - 'Model game states and transitions with graph-based structures' + 'Design efficient network architectures', + 'Implement routing protocols', + 'Analyze network vulnerability and security' ] } - ]; - categories: string[] = ['All', 'Technology', 'Infrastructure', 'Management','Entertainment']; + categories: string[] = ['All', 'Technology', 'Infrastructure']; selectedCategory: string = 'All'; searchTerm: string = ''; From f2889955069e13df793f77fbdffe620207e52504 Mon Sep 17 00:00:00 2001 From: SrijaVuppala295 Date: Fri, 1 Nov 2024 21:53:48 +0530 Subject: [PATCH 3/3] done --- .../realworld/realworld.component.css | 6 +- src/index.html | 160 +++++++++++++++--- 2 files changed, 142 insertions(+), 24 deletions(-) diff --git a/src/app/components/realworld/realworld.component.css b/src/app/components/realworld/realworld.component.css index f625210e..9e52ed74 100644 --- a/src/app/components/realworld/realworld.component.css +++ b/src/app/components/realworld/realworld.component.css @@ -5,10 +5,6 @@ font-style: normal; /* Normal font style */ } -*{ - margin: 0px; - padding: 0px; -} body { font-family: "Montserrat", sans-serif; /* Apply Montserrat to the body for all text */ font-weight: 400; /* Regular weight for body text */ @@ -25,7 +21,7 @@ body { max-width: 1200px; margin: 0 auto; padding: 0 2rem; - margin-top: 6rem; + margin-top: 4rem; } header { diff --git a/src/index.html b/src/index.html index 3e429119..ddfe0486 100644 --- a/src/index.html +++ b/src/index.html @@ -476,6 +476,67 @@ transition: width 0.2s ease; } + + + + @@ -498,15 +559,85 @@ Our Contributors - - + + + + + + + +

Contact Us