graph presentation

•

0 likes•4 views

The document discusses representing graphs and finding paths in graphs. It defines what a graph is formally as a set of vertices and edges. It introduces the adjacency matrix as a way to represent a graph, with rows and columns indicating connections between vertices. The document then explains how to use the adjacency matrix to find if there is a path between two vertices, by starting at the source vertex and exploring neighbors breadth-first until the target is reached.

DESIGN AND ANALYSIS
OF ALGORITHMS
Representing graphs
MADHAVAN MUKUND, CHENNAI MATHEMATICAL INSTITUTE
http://www.cmi.ac.in/~madhavan
NPTEL MOOC,JAN-FEB 2015
Week 3, Module 2

Graphs, formally
G = (V,E)
Set of vertices V
Set of edges E
E is a subset of pairs (v,v’): E ⊆ V × V
Undirected graph: (v,v’) and (v’,v) are the same edge
Directed graph:
(v,v’) is an edge from v to v’
Does not guarantee that (v’,v) is also an edge

Finding a
route
Directed graph
Find a sequence
of vertices v0, v1,
…, vk such that
v0 is New
Delhi
Each (vi,vi+1) is
an edge in E
vk is
Trivandrum
v0
v1
v2
v3
v4
v5

Finding a
route
Also makes sense
for undirected
graphs
Find a sequence
of vertices v0, v1,
…, vk such that
v0 is New Delhi
Each (vi,vi+1) is
an edge in E
vk is Trivandrum
v0
v1
v2
v3
v4
v5

Working with graphs
We are given G = (V,E), undirected
Is there a path from source vs to target vt?
Look at the picture and see if vs and vt are
connected
How do we get an algorithm to “look at the
picture”?

Representing graphs
Let V have n vertices
We can assume vertices are named 1,2,…,n
Each edge is now a pair (i,j), where 1 ≤ i,j ≤ n
Let A(i,j) = 1 if (i,j) is an edge and 0 otherwise
A is an n x n matrix describing the graph
Adjacency matrix

Adjacency matrix
1
2
3
4
5
6 7
8 9
10
1 2 3 4 5 6 7 8 9 10
1 0 1 1 1 0 0 0 0 0 0
2 1 0 1 0 0 0 0 0 0 0
3 1 1 0 0 0 0 0 0 0 0
4 1 0 0 0 1 0 0 1 0 0
5 0 0 0 1 0 1 1 0 0 0
6 0 0 0 0 1 0 1 1 1 0
7 0 0 0 0 1 1 0 0 0 0
8 0 0 0 1 0 1 0 0 1 0
9 0 0 0 0 0 1 0 1 0 1
10 0 0 0 0 0 0 0 0 1 0

Adjacency matrix
1 2 3 4 5 6 7 8 9 10
1 0 1 1 1 0 0 0 0 0 0
2 1 0 1 0 0 0 0 0 0 0
3 1 1 0 0 0 0 0 0 0 0
4 1 0 0 0 1 0 0 1 0 0
5 0 0 0 1 0 1 1 0 0 0
6 0 0 0 0 1 0 1 1 1 0
7 0 0 0 0 1 1 0 0 0 0
8 0 0 0 1 0 1 0 0 1 0
9 0 0 0 0 0 1 0 1 0 1
10 0 0 0 0 0 0 0 0 1 0
Neighbours of i
Any column j in row i
with entry 1
Scan row i from left
to right to identify all
neighbours
Neighbours of 4 are
{1,5,8}

Finding a path
1 2 3 4 5 6 7 8 9 10
1 0 1 1 1 0 0 0 0 0 0
2 1 0 1 0 0 0 0 0 0 0
3 1 1 0 0 0 0 0 0 0 0
4 1 0 0 0 1 0 0 1 0 0
5 0 0 0 1 0 1 1 0 0 0
6 0 0 0 0 1 0 1 1 1 0
7 0 0 0 0 1 1 0 0 0 0
8 0 0 0 1 0 1 0 0 1 0
9 0 0 0 0 0 1 0 1 0 1
10 0 0 0 0 0 0 0 0 1 0
Start with vs
New Delhi is 1
Mark each neighbour as
reachable
Explore neighbours of
marked vertices
Check if target is
marked
vt =10 = Trivandrum

Exploring graphs
Need a systematic algorithm
Mark vertices that have been visited
Keep track of vertices whose neighbours have
already been explored
Avoid going round indefinitely in circles
Two fundamental strategies: breadth first and
depth first

An alternative representation
1 2 3 4 5 6 7 8 9 10
1 0 1 1 1 0 0 0 0 0 0
2 1 0 1 0 0 0 0 0 0 0
3 1 1 0 0 0 0 0 0 0 0
4 1 0 0 0 1 0 0 1 0 0
5 0 0 0 1 0 1 1 0 0 0
6 0 0 0 0 1 0 1 1 1 0
7 0 0 0 0 1 1 0 0 0 0
8 0 0 0 1 0 1 0 0 1 0
9 0 0 0 0 0 1 0 1 0 1
10 0 0 0 0 0 0 0 0 1 0
Adjacency matrix has
many 0’s
Size of the matrix is n2
regardless of number
of edges
Maximum size of E is
n(n-1)/2 if we disallow
self loops
Typically E is much
smaller

Adjacency list
1
2
3
4
5
6 7
8 9
10
For each vertex, maintain a
list of its neighbours
1 2,3,4
2 1,3
3 1,2
4 1,5,8
5 4,6,7
6 5,7,8,9
7 5,6
8 4,6,9
9 6,8,10
10 9

Comparing representations
Adjacency list typically requires less space
Is j a neighbour of i?
Just check if A[i][j] is 1 in adjacency matrix
Need to scan neighbours of i in adjacency list
Which vertices are neighbours of i?
Scan all n columns in adjacency matrix
Takes time proportional to neighbours in adjacency
list

Selection sort is an in-place sorting algorithm that works by repeatedly finding the minimum element from unsorted part and putting it at the beginning. It maintains two subarrays, sorted subarray which is built up from left to right at the front of the array, and unsorted subarray to the right. In each iteration, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the next slot in the sorted subarray. This continues until the whole array is sorted. The time complexity of selection sort is O(n^2) as it requires n iterations and in each iteration it has to scan remaining unsorted elements to find the minimum.

merge sort

ObedurRahman1

The document summarizes the merge sort algorithm in 3 steps: 1) Divide the array into halves recursively until single elements remain. Sort the left and right halves separately. 2) Merge the sorted halves back together by comparing elements one by one from each half and writing the smaller element into the output array. 3) The overall algorithm runs in O(n log n) time by dividing and conquering the problem in a recursive manner.

insertion sort-new.pdf

ObedurRahman1

Insertion sort is an O(n^2) sorting algorithm that builds up a sorted array one element at a time. It works by taking the first unsorted element and inserting it into the correct place in the already sorted portion of the array. This requires linearly searching the sorted portion and shifting elements over to make space. Each pass increases the length of the sorted portion by one. While O(n^2), insertion sort performs better than other quadratic sorts like selection sort on arrays that are already partially sorted.

Week 2 Lecture Material.pdf

ObedurRahman1

week1-module1-introduction-merged.pdf

ObedurRahman1

The document describes an introduction to the design and analysis of algorithms course given by Madhavan Mukund at Chennai Mathematical Institute. It provides an overview of topics to be covered including asymptotic complexity, searching and sorting algorithms, graph algorithms, algorithm design techniques, and data structures. It outlines the course schedule, evaluation process, and recommended textbooks. Examples of algorithmic problems and potential solutions discussed include finding connected destinations in a flight network, scheduling photocopier jobs, computing document similarity, and searching and sorting algorithms.

2024 State of Marketing Report – by Hubspot

Marius Sescu

https://www.hubspot.com/state-of-marketing · Scaling relationships and proving ROI · Social media is the place for search, sales, and service · Authentic influencer partnerships fuel brand growth · The strongest connections happen via call, click, chat, and camera. · Time saved with AI leads to more creative work · Seeking: A single source of truth · TLDR; Get on social, try AI, and align your systems. · More human marketing, powered by robots

Everything You Need To Know About ChatGPT

Expeed Software

ChatGPT is a revolutionary addition to the world since its introduction in 2022. A big shift in the sector of information gathering and processing happened because of this chatbot. What is the story of ChatGPT? How is the bot responding to prompts and generating contents? Swipe through these slides prepared by Expeed Software, a web development company regarding the development and technical intricacies of ChatGPT!

Product Design Trends in 2024 | Teenage Engineerings

Pixeldarts

Consistent toolbox talks are critical for maintaining workplace safety, as they provide regular opportunities to address specific hazards and reinforce safe practices. These brief, focused sessions ensure that safety is a continual conversation rather than a one-time event, which helps keep safety protocols fresh in employees' minds. Studies have shown that shorter, more frequent training sessions are more effective for retention and behavior change compared to longer, infrequent sessions. Engaging workers regularly, toolbox talks promote a culture of safety, empower employees to voice concerns, and ultimately reduce the likelihood of accidents and injuries on site. The traditional method of conducting safety talks with paper documents and lengthy meetings is not only time-consuming but also less effective. Manual tracking of attendance and compliance is prone to errors and inconsistencies, leading to gaps in safety communication and potential non-compliance with OSHA regulations. Switching to a digital solution like Safelyio offers significant advantages. Safelyio automates the delivery and documentation of safety talks, ensuring consistency and accessibility. The microlearning approach breaks down complex safety protocols into manageable, bite-sized pieces, making it easier for employees to absorb and retain information. This method minimizes disruptions to work schedules, eliminates the hassle of paperwork, and ensures that all safety communications are tracked and recorded accurately. Ultimately, using a digital platform like Safelyio enhances engagement, compliance, and overall safety performance on site. https://safelyio.com/

Migration From CH 1.0 to CH 2.0 and Mule 4.6 & Java 17 Upgrade.pptx

ervikas4

Microservice Teams - How the cloud changes the way we work

Sven Peters

A lot of technical challenges and complexity come with building a cloud-native and distributed architecture. The way we develop backend software has fundamentally changed in the last ten years. Managing a microservices architecture demands a lot of us to ensure observability and operational resiliency. But did you also change the way you run your development teams? Sven will talk about Atlassian’s journey from a monolith to a multi-tenanted architecture and how it affected the way the engineering teams work. You will learn how we shifted to service ownership, moved to more autonomous teams (and its challenges), and established platform and enablement teams.

J-Spring 2024 - Going serverless with Quarkus, GraalVM native images and AWS ...

Bert Jan Schrijver

The Rising Future of CPaaS in the Middle East 2024

Yara Milbes

8 Best Automated Android App Testing Tool and Framework in 2024.pdf

kalichargn70th171

Modelling Up - DDDEurope 2024 - Amsterdam

Alberto Brandolini

Energy consumption of Database Management - Florina Jonuzi

Green Software Development

UI5con 2024 - Bring Your Own Design System

Peter Muessig

How do you combine the OpenUI5/SAPUI5 programming model with a design system that makes its controls available as Web Components? Since OpenUI5/SAPUI5 1.120, the framework supports the integration of any Web Components. This makes it possible, for example, to natively embed own Web Components of your design system which are created with Stencil. The integration embeds the Web Components in a way that they can be used naturally in XMLViews, like with standard UI5 controls, and can be bound with data binding. Learn how you can also make use of the Web Components base class in OpenUI5/SAPUI5 to also integrate your Web Components and get inspired by the solution to generate a custom UI5 library providing the Web Components control wrappers for the native ones.

Unlock the Secrets to Effortless Video Creation with Invideo: Your Ultimate G...

The Third Creative Media

"Navigating Invideo: A Comprehensive Guide" is an essential resource for anyone looking to master Invideo, an AI-powered video creation tool. This guide provides step-by-step instructions, helpful tips, and comparisons with other AI video creators. Whether you're a beginner or an experienced video editor, you'll find valuable insights to enhance your video projects and bring your creative ideas to life.

Why Apache Kafka Clusters Are Like Galaxies (And Other Cosmic Kafka Quandarie...

Paul Brebner

Closing talk for the Performance Engineering track at Community Over Code EU (Bratislava, Slovakia, June 5 2024) https://eu.communityovercode.org/sessions/2024/why-apache-kafka-clusters-are-like-galaxies-and-other-cosmic-kafka-quandaries-explored/ Instaclustr (now part of NetApp) manages 100s of Apache Kafka clusters of many different sizes, for a variety of use cases and customers. For the last 7 years I’ve been focused outwardly on exploring Kafka application development challenges, but recently I decided to look inward and see what I could discover about the performance, scalability and resource characteristics of the Kafka clusters themselves. Using a suite of Performance Engineering techniques, I will reveal some surprising discoveries about cosmic Kafka mysteries in our data centres, related to: cluster sizes and distribution (using Zipf’s Law), horizontal vs. vertical scalability, and predicting Kafka performance using metrics, modelling and regression techniques. These insights are relevant to Kafka developers and operators.

Baha Majid WCA4Z IBM Z Customer Council Boston June 2024.pdf

Baha Majid

IBM watsonx Code Assistant for Z, our latest Generative AI-assisted mainframe application modernization solution. Mainframe (IBM Z) application modernization is a topic that every mainframe client is addressing to various degrees today, driven largely from digital transformation. With generative AI comes the opportunity to reimagine the mainframe application modernization experience. Infusing generative AI will enable speed and trust, help de-risk, and lower total costs associated with heavy-lifting application modernization initiatives. This document provides an overview of the IBM watsonx Code Assistant for Z which uses the power of generative AI to make it easier for developers to selectively modernize COBOL business services while maintaining mainframe qualities of service.

Mobile App Development Company In Noida | Drona Infotech

Drona Infotech

UI5con 2024 - Keynote: Latest News about UI5 and it’s Ecosystem

Peter Muessig

WWDC 2024 Keynote Review: For CocoaCoders Austin

Patrick Weigel

14 th Edition of International conference on computer vision

ShulagnaSarkar2

About the event 14th Edition of International conference on computer vision Computer conferences organized by ScienceFather group. ScienceFather takes the privilege to invite speakers participants students delegates and exhibitors from across the globe to its International Conference on computer conferences to be held in the Various Beautiful cites of the world. computer conferences are a discussion of common Inventions-related issues and additionally trade information share proof thoughts and insight into advanced developments in the science inventions service system. New technology may create many materials and devices with a vast range of applications such as in Science medicine electronics biomaterials energy production and consumer products. Nomination are Open!! Don't Miss it Visit: computer.scifat.com Award Nomination: https://x-i.me/ishnom Conference Submission: https://x-i.me/anicon For Enquiry: Computer@scifat.com

Kubernetes at Scale: Going Multi-Cluster with Istio

Severalnines

一比一原版(USF毕业证)旧金山大学毕业证如何办理

dakas1

USF硕士毕业证成绩单【微信95270640】一比一伪造旧金山大学文凭@假冒USF毕业证成绩单+Q微信95270640办理USF学位证书@仿造USF毕业文凭证书@购买旧金山大学毕业证成绩单USF真实使馆认证/真实留信认证回国人员证明 #一整套旧金山大学文凭证件办理#—包含旧金山大学旧金山大学本科毕业证成绩单学历认证|使馆认证|归国人员证明|教育部认证|留信网认证永远存档教育部学历学位认证查询办理国外文凭国外学历学位认证#我们提供全套办理服务。一整套留学文凭证件服务：一：旧金山大学旧金山大学本科毕业证成绩单毕业证 #成绩单等全套材料从防伪到印刷水印底纹到钢印烫金二：真实使馆认证（留学人员回国证明）使馆存档三：真实教育部认证教育部存档教育部留服网站永久可查四：留信认证留学生信息网站永久可查国外毕业证学位证成绩单办理方法： 1客户提供办理旧金山大学旧金山大学本科毕业证成绩单信息：姓名生日专业学位毕业时间等（如信息不确定可以咨询顾问：我们有专业老师帮你查询）； 2开始安排制作毕业证成绩单电子图； 3毕业证成绩单电子版做好以后发送给您确认； 4毕业证成绩单电子版您确认信息无误之后安排制作成品； 5成品做好拍照或者视频给您确认； 6快递给客户（国内顺丰国外DHLUPS等快读邮寄）。教育部文凭学历认证认证的用途：如果您计划在国内发展那么办理国内教育部认证是必不可少的。事业性用人单位如银行国企公务员在您应聘时都会需要您提供这个认证。其他私营 #外企企业无需提供！办理教育部认证所需资料众多且烦琐所有材料您都必须提供原件我们凭借丰富的经验帮您快速整合材料让您少走弯路。实体公司专业为您服务如有需要请联系我: 微信95270640奈一次次令他失望山娃今年岁上五年级识得很多字从走出小屋开始山娃就知道父亲的家和工地共有一个很动听的名字——天河工地的底层空空荡荡很宽阔很凉爽在地上铺上报纸和水泥袋父亲和工人们中午全睡在地上地面坑坑洼洼山娃曾多次绊倒过也曾有长铁钉穿透凉鞋刺在脚板上但山娃不怕工地上也常有五六个从乡下来的小学生他们的父母亲也是高楼上的建筑工人小伙伴来自不同省份都操着带有浓重口音的普通话可不知为啥山娃不仅很快与他们熟识了

Oracle 23c New Features For DBAs and Developers.pptx

Remote DBA Services

All you need to know about Spring Boot and GraalVM

Alina Yurenko

How Race, Age and Gender Shape Attitudes Towards Mental Health

ThinkNow

Mental health has been in the news quite a bit lately. Dozens of U.S. states are currently suing Meta for contributing to the youth mental health crisis by inserting addictive features into their products, while the U.S. Surgeon General is touring the nation to bring awareness to the growing epidemic of loneliness and isolation. The country has endured periods of low national morale, such as in the 1970s when high inflation and the energy crisis worsened public sentiment following the Vietnam War. The current mood, however, feels different. Gallup recently reported that national mental health is at an all-time low, with few bright spots to lift spirits. To better understand how Americans are feeling and their attitudes towards mental health in general, ThinkNow conducted a nationally representative quantitative survey of 1,500 respondents and found some interesting differences among ethnic, age and gender groups. Technology For example, 52% agree that technology and social media have a negative impact on mental health, but when broken out by race, 61% of Whites felt technology had a negative effect, and only 48% of Hispanics thought it did. While technology has helped us keep in touch with friends and family in faraway places, it appears to have degraded our ability to connect in person. Staying connected online is a double-edged sword since the same news feed that brings us pictures of the grandkids and fluffy kittens also feeds us news about the wars in Israel and Ukraine, the dysfunction in Washington, the latest mass shooting and the climate crisis. Hispanics may have a built-in defense against the isolation technology breeds, owing to their large, multigenerational households, strong social support systems, and tendency to use social media to stay connected with relatives abroad. Age and Gender When asked how individuals rate their mental health, men rate it higher than women by 11 percentage points, and Baby Boomers rank it highest at 83%, saying it’s good or excellent vs. 57% of Gen Z saying the same. Gen Z spends the most amount of time on social media, so the notion that social media negatively affects mental health appears to be correlated. Unfortunately, Gen Z is also the generation that’s least comfortable discussing mental health concerns with healthcare professionals. Only 40% of them state they’re comfortable discussing their issues with a professional compared to 60% of Millennials and 65% of Boomers. Race Affects Attitudes As seen in previous research conducted by ThinkNow, Asian Americans lag other groups when it comes to awareness of mental health issues. Twenty-four percent of Asian Americans believe that having a mental health issue is a sign of weakness compared to the 16% average for all groups. Asians are also considerably less likely to be aware of mental health services in their communities (42% vs. 55%) and most likely to seek out information on social media (51% vs. 35%).

AI Trends in Creative Operations 2024 by Artwork Flow.pdf

marketingartwork

Creative operations teams expect increased AI use in 2024. Currently, over half of tasks are not AI-enabled, but this is expected to decrease in the coming year. ChatGPT is the most popular AI tool currently. Business leaders are more actively exploring AI benefits than individual contributors. Most respondents do not believe AI will impact workforce size in 2024. However, some inhibitions still exist around AI accuracy and lack of understanding. Creatives primarily want to use AI to save time on mundane tasks and boost productivity.

Recently uploaded

Safelyio Toolbox Talk Softwate & App (How To Digitize Safety Meetings)

safelyiotech

Migration From CH 1.0 to CH 2.0 and Mule 4.6 & Java 17 Upgrade.pptx

ervikas4

Microservice Teams - How the cloud changes the way we work

Sven Peters

J-Spring 2024 - Going serverless with Quarkus, GraalVM native images and AWS ...

Bert Jan Schrijver

The Rising Future of CPaaS in the Middle East 2024

Yara Milbes

8 Best Automated Android App Testing Tool and Framework in 2024.pdf

kalichargn70th171

Modelling Up - DDDEurope 2024 - Amsterdam

Alberto Brandolini

Energy consumption of Database Management - Florina Jonuzi

Green Software Development

UI5con 2024 - Bring Your Own Design System

Peter Muessig

Unlock the Secrets to Effortless Video Creation with Invideo: Your Ultimate G...

The Third Creative Media

Why Apache Kafka Clusters Are Like Galaxies (And Other Cosmic Kafka Quandarie...

Paul Brebner

Baha Majid WCA4Z IBM Z Customer Council Boston June 2024.pdf

Baha Majid

Mobile App Development Company In Noida | Drona Infotech

Drona Infotech

UI5con 2024 - Keynote: Latest News about UI5 and it’s Ecosystem

Peter Muessig

WWDC 2024 Keynote Review: For CocoaCoders Austin

Patrick Weigel

14 th Edition of International conference on computer vision

ShulagnaSarkar2

Kubernetes at Scale: Going Multi-Cluster with Istio

Severalnines

一比一原版(USF毕业证)旧金山大学毕业证如何办理

dakas1

Oracle 23c New Features For DBAs and Developers.pptx

Remote DBA Services

All you need to know about Spring Boot and GraalVM

Alina Yurenko

Recently uploaded (20)

Safelyio Toolbox Talk Softwate & App (How To Digitize Safety Meetings)

Migration From CH 1.0 to CH 2.0 and Mule 4.6 & Java 17 Upgrade.pptx

Microservice Teams - How the cloud changes the way we work

J-Spring 2024 - Going serverless with Quarkus, GraalVM native images and AWS ...

The Rising Future of CPaaS in the Middle East 2024

8 Best Automated Android App Testing Tool and Framework in 2024.pdf

Modelling Up - DDDEurope 2024 - Amsterdam

Energy consumption of Database Management - Florina Jonuzi

UI5con 2024 - Bring Your Own Design System

Unlock the Secrets to Effortless Video Creation with Invideo: Your Ultimate G...

Why Apache Kafka Clusters Are Like Galaxies (And Other Cosmic Kafka Quandarie...

Baha Majid WCA4Z IBM Z Customer Council Boston June 2024.pdf

Mobile App Development Company In Noida | Drona Infotech

UI5con 2024 - Keynote: Latest News about UI5 and it’s Ecosystem

WWDC 2024 Keynote Review: For CocoaCoders Austin

14 th Edition of International conference on computer vision

Kubernetes at Scale: Going Multi-Cluster with Istio

一比一原版(USF毕业证)旧金山大学毕业证如何办理

Oracle 23c New Features For DBAs and Developers.pptx

All you need to know about Spring Boot and GraalVM

Featured

How Race, Age and Gender Shape Attitudes Towards Mental Health

ThinkNow

AI Trends in Creative Operations 2024 by Artwork Flow.pdf

marketingartwork

Skeleton Culture Code

Skeleton Technologies

Organizational culture includes values, norms, systems, symbols, language, assumptions, beliefs, and habits that influence employee behaviors and how people interpret those behaviors. It is important because culture can help or hinder a company's success. Some key aspects of Netflix's culture that help it achieve results include hiring smartly so every position has stars, focusing on attitude over just aptitude, and having a strict policy against peacocks, whiners, and jerks.

PEPSICO Presentation to CAGNY Conference Feb 2024

Neil Kimberley

PepsiCo provided a safe harbor statement noting that any forward-looking statements are based on currently available information and are subject to risks and uncertainties. It also provided information on non-GAAP measures and directing readers to its website for disclosure and reconciliation. The document then discussed PepsiCo's business overview, including that it is a global beverage and convenient food company with iconic brands, $91 billion in net revenue in 2023, and nearly $14 billion in core operating profit. It operates through a divisional structure with a focus on local consumers.

Content Methodology: A Best Practices Report (Webinar)

contently

This document provides an overview of content methodology best practices. It defines content methodology as establishing objectives, KPIs, and a culture of continuous learning and iteration. An effective methodology focuses on connecting with audiences, creating optimal content, and optimizing processes. It also discusses why a methodology is needed due to the competitive landscape, proliferation of channels, and opportunities for improvement. Components of an effective methodology include defining objectives and KPIs, audience analysis, identifying opportunities, and evaluating resources. The document concludes with recommendations around creating a content plan, testing and optimizing content over 90 days.

How to Prepare For a Successful Job Search for 2024

Albert Qian

The document provides guidance on preparing a job search for 2024. It discusses the state of the job market, focusing on growth in AI and healthcare but also continued layoffs. It recommends figuring out what you want to do by researching interests and skills, then conducting informational interviews. The job search should involve building a personal brand on LinkedIn, actively applying to jobs, tailoring resumes and interviews, maintaining job hunting as a habit, and continuing self-improvement. Once hired, the document advises setting new goals and keeping skills and networking active in case of future opportunities.

Social Media Marketing Trends 2024 // The Global Indie Insights

Kurio // The Social Media Age(ncy)

A report by thenetworkone and Kurio. The contributing experts and agencies are (in an alphabetical order): Sylwia Rytel, Social Media Supervisor, 180heartbeats + JUNG v MATT (PL), Sharlene Jenner, Vice President - Director of Engagement Strategy, Abelson Taylor (USA), Alex Casanovas, Digital Director, Atrevia (ES), Dora Beilin, Senior Social Strategist, Barrett Hoffher (USA), Min Seo, Campaign Director, Brand New Agency (KR), Deshé M. Gully, Associate Strategist, Day One Agency (USA), Francesca Trevisan, Strategist, Different (IT), Trevor Crossman, CX and Digital Transformation Director; Olivia Hussey, Strategic Planner; Simi Srinarula, Social Media Manager, The Hallway (AUS), James Hebbert, Managing Director, Hylink (CN / UK), Mundy Álvarez, Planning Director; Pedro Rojas, Social Media Manager; Pancho González, CCO, Inbrax (CH), Oana Oprea, Head of Digital Planning, Jam Session Agency (RO), Amy Bottrill, Social Account Director, Launch (UK), Gaby Arriaga, Founder, Leonardo1452 (MX), Shantesh S Row, Creative Director, Liwa (UAE), Rajesh Mehta, Chief Strategy Officer; Dhruv Gaur, Digital Planning Lead; Leonie Mergulhao, Account Supervisor - Social Media & PR, Medulla (IN), Aurelija Plioplytė, Head of Digital & Social, Not Perfect (LI), Daiana Khaidargaliyeva, Account Manager, Osaka Labs (UK / USA), Stefanie Söhnchen, Vice President Digital, PIABO Communications (DE), Elisabeth Winiartati, Managing Consultant, Head of Global Integrated Communications; Lydia Aprina, Account Manager, Integrated Marketing and Communications; Nita Prabowo, Account Manager, Integrated Marketing and Communications; Okhi, Web Developer, PNTR Group (ID), Kei Obusan, Insights Director; Daffi Ranandi, Insights Manager, Radarr (SG), Gautam Reghunath, Co-founder & CEO, Talented (IN), Donagh Humphreys, Head of Social and Digital Innovation, THINKHOUSE (IRE), Sarah Yim, Strategy Director, Zulu Alpha Kilo (CA).

Trends In Paid Search: Navigating The Digital Landscape In 2024

Search Engine Journal

The search marketing landscape is evolving rapidly with new technologies, and professionals, like you, rely on innovative paid search strategies to meet changing demands. It’s important that you’re ready to implement new strategies in 2024. Check this out and learn the top trends in paid search advertising that are expected to gain traction, so you can drive higher ROI more efficiently in 2024. You’ll learn: - The latest trends in AI and automation, and what this means for an evolving paid search ecosystem. - New developments in privacy and data regulation. - Emerging ad formats that are expected to make an impact next year. Watch Sreekant Lanka from iQuanti and Irina Klein from OneMain Financial as they dive into the future of paid search and explore the trends, strategies, and technologies that will shape the search marketing landscape. If you’re looking to assess your paid search strategy and design an industry-aligned plan for 2024, then this webinar is for you.

5 Public speaking tips from TED - Visualized summary

SpeakerHub

From their humble beginnings in 1984, TED has grown into the world’s most powerful amplifier for speakers and thought-leaders to share their ideas. They have over 2,400 filmed talks (not including the 30,000+ TEDx videos) freely available online, and have hosted over 17,500 events around the world. With over one billion views in a year, it’s no wonder that so many speakers are looking to TED for ideas on how to share their message more effectively. The article “5 Public-Speaking Tips TED Gives Its Speakers”, by Carmine Gallo for Forbes, gives speakers five practical ways to connect with their audience, and effectively share their ideas on stage. Whether you are gearing up to get on a TED stage yourself, or just want to master the skills that so many of their speakers possess, these tips and quotes from Chris Anderson, the TED Talks Curator, will encourage you to make the most impactful impression on your audience. See the full article and more summaries like this on SpeakerHub here: https://speakerhub.com/blog/5-presentation-tips-ted-gives-its-speakers See the original article on Forbes here: http://www.forbes.com/forbes/welcome/?toURL=http://www.forbes.com/sites/carminegallo/2016/05/06/5-public-speaking-tips-ted-gives-its-speakers/&refURL=&referrer=#5c07a8221d9b

ChatGPT and the Future of Work - Clark Boyd

Clark Boyd

Everyone is in agreement that ChatGPT (and other generative AI tools) will shape the future of work. Yet there is little consensus on exactly how, when, and to what extent this technology will change our world. Businesses that extract maximum value from ChatGPT will use it as a collaborative tool for everything from brainstorming to technical maintenance. For individuals, now is the time to pinpoint the skills the future professional will need to thrive in the AI age. Check out this presentation to understand what ChatGPT is, how it will shape the future of work, and how you can prepare to take advantage.

Getting into the tech field. what next

Tessa Mero

The document provides career advice for getting into the tech field, including: - Doing projects and internships in college to build a portfolio. - Learning about different roles and technologies through industry research. - Contributing to open source projects to build experience and network. - Developing a personal brand through a website and social media presence. - Networking through events, communities, and finding a mentor. - Practicing interviews through mock interviews and whiteboarding coding questions.

Google's Just Not That Into You: Understanding Core Updates & Search Intent

Lily Ray

1. Core updates from Google periodically change how its algorithms assess and rank websites and pages. This can impact rankings through shifts in user intent, site quality issues being caught up to, world events influencing queries, and overhauls to search like the E-A-T framework. 2. There are many possible user intents beyond just transactional, navigational and informational. Identifying intent shifts is important during core updates. Sites may need to optimize for new intents through different content types and sections. 3. Responding effectively to core updates requires analyzing "before and after" data to understand changes, identifying new intents or page types, and ensuring content matches appropriate intents across video, images, knowledge graphs and more.

How to have difficult conversations

Rajiv Jayarajah, MAppComm, ACC

Introduction to Data Science

Christy Abraham Joy

Time Management & Productivity - Best Practices

Vit Horky

The six step guide to practical project management

MindGenius

The six step guide to practical project management If you think managing projects is too difficult, think again. We’ve stripped back project management processes to the basics – to make it quicker and easier, without sacrificing the vital ingredients for success. “If you’re looking for some real-world guidance, then The Six Step Guide to Practical Project Management will help.” Dr Andrew Makar, Tactical Project Management

Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...

RachelPearson36

Unlocking the Power of ChatGPT and AI in Testing - A Real-World Look, present...

Applitools

During this webinar, Anand Bagmar demonstrates how AI tools such as ChatGPT can be applied to various stages of the software development life cycle (SDLC) using an eCommerce application case study. Find the on-demand recording and more info at https://applitools.info/b59 Key takeaways: • Learn how to use ChatGPT to add AI power to your testing and test automation • Understand the limitations of the technology and where human expertise is crucial • Gain insight into different AI-based tools • Adopt AI-based tools to stay relevant and optimize work for developers and testers * ChatGPT and OpenAI belong to OpenAI, L.L.C.

12 Ways to Increase Your Influence at Work

GetSmarter

ChatGPT webinar slides

Alireza Esmikhani

The document discusses various AI tools from OpenAI like GPT-3 and DALL-E 2, as well as ChatGPT. It explores how search engines are using AI and things to consider around AI-generated content. Potential SEO uses of ChatGPT are also presented, such as generating content at scale, conducting topic research, and automating basic coding tasks. The document encourages further reading on using ChatGPT for SEO purposes.

Featured (20)

How Race, Age and Gender Shape Attitudes Towards Mental Health

AI Trends in Creative Operations 2024 by Artwork Flow.pdf

Skeleton Culture Code

PEPSICO Presentation to CAGNY Conference Feb 2024

Content Methodology: A Best Practices Report (Webinar)

How to Prepare For a Successful Job Search for 2024

Social Media Marketing Trends 2024 // The Global Indie Insights

Trends In Paid Search: Navigating The Digital Landscape In 2024

5 Public speaking tips from TED - Visualized summary

ChatGPT and the Future of Work - Clark Boyd

Getting into the tech field. what next

Google's Just Not That Into You: Understanding Core Updates & Search Intent

How to have difficult conversations

Introduction to Data Science

Time Management & Productivity - Best Practices

The six step guide to practical project management

Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...

Unlocking the Power of ChatGPT and AI in Testing - A Real-World Look, present...

12 Ways to Increase Your Influence at Work

ChatGPT webinar slides

graph presentation

1. DESIGN AND ANALYSIS OF ALGORITHMS Representing graphs MADHAVAN MUKUND, CHENNAI MATHEMATICAL INSTITUTE http://www.cmi.ac.in/~madhavan NPTEL MOOC,JAN-FEB 2015 Week 3, Module 2

2. Graphs, formally G = (V,E) Set of vertices V Set of edges E E is a subset of pairs (v,v’): E ⊆ V × V Undirected graph: (v,v’) and (v’,v) are the same edge Directed graph: (v,v’) is an edge from v to v’ Does not guarantee that (v’,v) is also an edge

3. Finding a route Directed graph Find a sequence of vertices v0, v1, …, vk such that v0 is New Delhi Each (vi,vi+1) is an edge in E vk is Trivandrum v0 v1 v2 v3 v4 v5

4. Finding a route Also makes sense for undirected graphs Find a sequence of vertices v0, v1, …, vk such that v0 is New Delhi Each (vi,vi+1) is an edge in E vk is Trivandrum v0 v1 v2 v3 v4 v5

5. Working with graphs We are given G = (V,E), undirected Is there a path from source vs to target vt? Look at the picture and see if vs and vt are connected How do we get an algorithm to “look at the picture”?

6. Representing graphs Let V have n vertices We can assume vertices are named 1,2,…,n Each edge is now a pair (i,j), where 1 ≤ i,j ≤ n Let A(i,j) = 1 if (i,j) is an edge and 0 otherwise A is an n x n matrix describing the graph Adjacency matrix

7. Adjacency matrix 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0

8. Adjacency matrix 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Neighbours of i Any column j in row i with entry 1 Scan row i from left to right to identify all neighbours Neighbours of 4 are {1,5,8}

9. Adjacency matrix 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Neighbours of i Any column j in row i with entry 1 Scan row i from left to right to identify all neighbours Neighbours of 4 are {1,5,8}

10. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

11. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

12. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

13. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

14. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

15. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

16. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

17. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

18. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

19. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

20. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

21. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

22. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

23. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

24. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

25. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

26. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

27. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

28. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

29. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

30. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

31. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

32. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

33. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

34. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

35. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

36. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

37. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

38. Finding a path 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Start with vs New Delhi is 1 Mark each neighbour as reachable Explore neighbours of marked vertices Check if target is marked vt =10 = Trivandrum

39. Exploring graphs Need a systematic algorithm Mark vertices that have been visited Keep track of vertices whose neighbours have already been explored Avoid going round indefinitely in circles Two fundamental strategies: breadth first and depth first

40. An alternative representation 1 2 3 4 5 6 7 8 9 10 1 0 1 1 1 0 0 0 0 0 0 2 1 0 1 0 0 0 0 0 0 0 3 1 1 0 0 0 0 0 0 0 0 4 1 0 0 0 1 0 0 1 0 0 5 0 0 0 1 0 1 1 0 0 0 6 0 0 0 0 1 0 1 1 1 0 7 0 0 0 0 1 1 0 0 0 0 8 0 0 0 1 0 1 0 0 1 0 9 0 0 0 0 0 1 0 1 0 1 10 0 0 0 0 0 0 0 0 1 0 Adjacency matrix has many 0’s Size of the matrix is n2 regardless of number of edges Maximum size of E is n(n-1)/2 if we disallow self loops Typically E is much smaller

41. Adjacency list 1 2 3 4 5 6 7 8 9 10 For each vertex, maintain a list of its neighbours 1 2,3,4 2 1,3 3 1,2 4 1,5,8 5 4,6,7 6 5,7,8,9 7 5,6 8 4,6,9 9 6,8,10 10 9

42. Comparing representations Adjacency list typically requires less space Is j a neighbour of i? Just check if A[i][j] is 1 in adjacency matrix Need to scan neighbours of i in adjacency list Which vertices are neighbours of i? Scan all n columns in adjacency matrix Takes time proportional to neighbours in adjacency list

graph presentation

Recommended

Recommended

More Related Content

Recently uploaded

Recently uploaded (20)

Featured

Featured (20)

graph presentation