1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Lunna [17]
3 years ago
13

What is the pair of vertical angles.

Mathematics
2 answers:
kobusy [5.1K]3 years ago
8 0

Answer:

C.

Step-by-step explanation:

Tatiana [17]3 years ago
6 0

Answer:

=answer is the vertical angles

C

You might be interested in
giles is searching for a sock and discovers that he has 10 socks for every 5 pairs of shoes. if he has 20 socks how many pair of
nekit [7.7K]
It will be 10 pair of shoe
8 0
3 years ago
Bethany earned a total of $175 for babysitting over her summer break. Which expression shows how much money Bethany earned each
erica [24]

Answer:

175+ braniliest pls

Step-by-step explanation:

175+

5 0
3 years ago
Read 2 more answers
-2x+8x=20 ans can you please include the steps. Thank you
sladkih [1.3K]

Hope this helps :).    

3 0
3 years ago
Read 2 more answers
If a factory produces 1,672 steering wheels during an 11 hour shift , what is the production rate of steering wheels per hour? [
d1i1m1o1n [39]
152 per hour. Just take the 1672 and divide it by 11 to get your rate of change
3 0
2 years ago
Using the Breadth-First Search Algorithm, determine the minimum number of edges that it would require to reach
jekas [21]

Answer:

The algorithm is given below.

#include <iostream>

#include <vector>

#include <utility>

#include <algorithm>

using namespace std;

const int MAX = 1e4 + 5;

int id[MAX], nodes, edges;

pair <long long, pair<int, int> > p[MAX];

void initialize()

{

   for(int i = 0;i < MAX;++i)

       id[i] = i;

}

int root(int x)

{

   while(id[x] != x)

   {

       id[x] = id[id[x]];

       x = id[x];

   }

   return x;

}

void union1(int x, int y)

{

   int p = root(x);

   int q = root(y);

   id[p] = id[q];

}

long long kruskal(pair<long long, pair<int, int> > p[])

{

   int x, y;

   long long cost, minimumCost = 0;

   for(int i = 0;i < edges;++i)

   {

       // Selecting edges one by one in increasing order from the beginning

       x = p[i].second.first;

       y = p[i].second.second;

       cost = p[i].first;

       // Check if the selected edge is creating a cycle or not

       if(root(x) != root(y))

       {

           minimumCost += cost;

           union1(x, y);

       }    

   }

   return minimumCost;

}

int main()

{

   int x, y;

   long long weight, cost, minimumCost;

   initialize();

   cin >> nodes >> edges;

   for(int i = 0;i < edges;++i)

   {

       cin >> x >> y >> weight;

       p[i] = make_pair(weight, make_pair(x, y));

   }

   // Sort the edges in the ascending order

   sort(p, p + edges);

   minimumCost = kruskal(p);

   cout << minimumCost << endl;

   return 0;

}

8 0
3 years ago
Other questions:
  • Carmen hiked at Yosemite national park for 1.25 hours. Her average speed was 3.9 miles per hour. How many miles did she hike? Gi
    13·1 answer
  • ASAP I REALLY NEED HELP I WILL MAKE THE BRAINLIEST
    14·1 answer
  • Factor the trinomial below.
    8·1 answer
  • Which set of coordinates represents a function?
    9·1 answer
  • Please help me with this question.Thanks!
    6·2 answers
  • Conclusion: m∠SPT + m∠TPU = 90° Which of the statements supports the conclusion from the diagram and the GIVEN information.
    14·1 answer
  • Which of the following is a term in the<br> expression 3x2 + 5x +9?
    7·1 answer
  • An elevator starts on the 100th floor of a building it decends 4 floors every 10 seconds.At what floor will be in 60 seconds aft
    6·2 answers
  • 24 3/8 inches <br><br> - 12 3/4 inches<br><br> = ?<br><br> Correct gets brainliest
    9·1 answer
  • Please help I can’t figure this out it’s been a very long time since I was in 5th grade. Thanks
    7·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!