Operations
The basic operations provided by a graph data structure G usually include:
adjacent(G, x, y): tests whether there is an edge from node x to node y.neighbors(G, x): lists all nodes y such that there is an edge from x to y.add(G, x, y): adds to G the edge from x to y, if it is not there.delete(G, x, y): removes the edge from x to y, if it is there.get_node_value(G, x): returns the value associated with the node x.set_node_value(G, x, a): sets the value associated with the node x to a.
Structures that associate values to the edges usually also provide:
get_edge_value(G, x, y): returns the value associated to the edge (x,y).set_edge_value(G, x, y, v): sets the value associated to the edge (x,y) to v.
Read more about this topic: Graph (abstract Data Type)
Famous quotes containing the word operations:
“There is a patent office at the seat of government of the universe, whose managers are as much interested in the dispersion of seeds as anybody at Washington can be, and their operations are infinitely more extensive and regular.”
—Henry David Thoreau (1817–1862)
“It may seem strange that any road through such a wilderness should be passable, even in winter, when the snow is three or four feet deep, but at that season, wherever lumbering operations are actively carried on, teams are continually passing on the single track, and it becomes as smooth almost as a railway.”
—Henry David Thoreau (1817–1862)
“You can’t have operations without screams. Pain and the knife—they’re inseparable.”
—Jean Scott Rogers. Robert Day. Mr. Blount (Frank Pettingell)