These structures are processed through Google’s Pregel framework. Systems based on these structures may come with tools for triangle counting and include Neo4j. Data is fetched through a query language named for these structures that is sometimes provided by services like GitHub as an alternative to their REST APIs; that language is named “[these structures]-Q-L”. (-5[2])They’re not pages, but the (-5[1])“web” instance of these structures is operated on by (*) PageRank. Within these data structures, (-5[1])the reverse-delete algorithm or Kruskal’s algorithm may be used to locate MSTs. These data structures are traversed during BFS and DFS. Adjacency lists and matrices are often used to encode, for 10 points, what abstract data structures that consist of vertices linked by edges? (10[1]) (10[3]0[2])■END■