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 8063247
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 5, 20262026-06-05T10:57:50+00:00 2026-06-05T10:57:50+00:00

Concerning floyds(int a[][100],int n). What does ‘a’ and represent and what does each of

  • 0

Concerning

floyds(int a[][100],int n).

What does ‘a’ and represent and what does each of the two dimensions of a represent?

What does ‘n’ represent?

I have a list of locations, with a list of connections between those locations and have computed the distance between those connections that are connect to each other. Now I need to find shortest path between any given two locations (floyd’s) – but need to understand how to apply floyds(int a[][100],int n) to my locations array, city dictionaries, and connection arrays.

FYI – Using objective C – iOS.

  • 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-06-05T10:57:52+00:00Added an answer on June 5, 2026 at 10:57 am

    n is the number of nodes in the graph.

    a is an distance matrix of the graph. a[i][j] is the cost (or distance) of the edge from node i to node j.

    (Also read the definition of adjacency matrix if you need more help with the concept.)

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

Sidebar

Related Questions

I have two questions concerning the sleep() function in PHP: Does the sleep time
Concerning data binding I have these classes: public class Foo : List<Bar> { public
I have an issue concerning constraints which should be generated dynamically from a list
I have two questions concerning the Django ChoiceField: This is my form: class ContactForm(forms.Form):
I have two questions concerning authentication of a intranet website and how to go
This is a question concerning android applications with two different .apks (or two apps
I have a question concerning subtypes of built-in types and their constructors. I want
I have question concerning a function I created. I would like to show the
I have a question concerning Core Data and how, if at all, Entities get
Concerning headers in a library, I see two options, and I'm not sure if

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.