## Description

There are total four questions in the document "h4c". These question are about how to apply algorithms to graph. For example, to write an algorithm to check if a graph can be represented as an adjacency or incidence matrix. you need to know about what is adjacency matrix and incidence matrix in graph. Also you need to know some programming language. Because some of the question in the document will ask you to write a program to implement the algorithm you wrote. After that you will also need to give me the input and output you used to test your program. ðŸ˜€

### Unformatted Attachment Preview

Purchase answer to see full attachment

## Explanation & Answer

Okay, here is the file, spell corrected and I hope it helps!remember, I can still help you specially, if you can not load the program... just extend time and tell me!

Incidence Matrix and Adjacent Matrix.

To Solve this problem first we must differentiate well Incidence and Adjacent Matrix.

Incidence Matrix

- With this graph, we can only know if one node is connecting others through their edges.

It clearly says it in the description what incidence matrix is.

We can see in the graph there are Vertices (the circles) and Edges (the lines connecting to other

vertices).

Incidence Matrix shows only the relationship of Vertices and Edges, where there is a 1 if there is

a connection between them and 0 if there is not.

Adjacent Matrix

- With this graph, we can only know if certain nodes are connected with others or not.

The difference is that among Vertices and Edges, this matrix will not show any relationship with

edges, instead of with other Vertices. If there are other Vertices next to it, we will graph a 1 and

if there are other Vertices we place...