Vertex w is adjacent to vertex v if there is an edge from v to w. An unweighted path length is the sum of the edge costs on a path. The weighted path length is the number of edges in a path. A cycle in a directed graph starts and ends on the same vertex, and contains at least one edge.

How often do you use databases or applications that rely on databases in your everyday life? Think about if you use databases for commercial, instructional, or social networking purposes. In your discussion post, please include at least two instances of your use of databases.

Identify the databases that have information about you. Can you get a printout of your data record from each database and how frequently can you get it? what are your data privacy concerns?

Data privacy improvement methods?