Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6962325
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T15:38:45+00:00 2026-05-27T15:38:45+00:00

I am doing a project on Social Network Analysis of Facebook Network. I had

  • 0

I am doing a project on Social Network Analysis of Facebook Network. I had to get all my friends and who of my friends are friends with each other, mutual frindships inside my network. I did that, I got all id’s of my friends and adjacencies and now I have to form an adjacency matric which indicates if 2 of my friends are friends. For example:
A and B are friends, A and C are friends, but B and C are not friends. This would look like this:

  A  B  C

A 0  1  1

B 1  0  0

C 1  0  0

Because I have the list of id’s and adjacencies already in python, I should also do the matrix in python, so if you have any ideas or a basic algorithm how to enter 1’s and 0’s I would appreciate it.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-27T15:38:46+00:00Added an answer on May 27, 2026 at 3:38 pm

    I solved the problem, it just required 2 for loops to go thorugh the list and compare whether the users id is in the adjacency list, if that is the case, make that entry 1, otherwise 0.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Im doing a project where Alice and Bob send each other messages using the
Hi Ive been planning on doing a social network project and im wondering if
I am doing some research for some social network project which i am going
Hi I am doing an social networking project ,where i have an option to
I am doing an social networking project ,where i have an option to add/edit
There's this project I am working on. This is like a social network where
I'm doing a project with Spring 3 + Hibernate. When I try to get
I'm doing project on android chat application with both friends and anonymous. we finished
I've been doing project Euler for a few days, and I have to admit
I'm doing project on object detection using javacv in that I went through couple

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.