File tree 1 file changed +4
-3
lines changed
1 file changed +4
-3
lines changed Original file line number Diff line number Diff line change 77
77
[ The digraph module] ( http://erlang.org/doc/man/digraph.html ) (as well as
78
78
[ digraph_utils] ( http://erlang.org/doc/man/digraph_utils.html ) ) contains
79
79
functions for dealing with directed graphs built of vertices and edges.
80
- After constructing the graph, the algorithms in there will help finding ,
80
+ After constructing the graph, the algorithms in there will help find ,
81
81
for instance, the shortest path between two vertices, or loops in the graph.
82
82
83
83
Given three vertices, find the shortest path from the first to the last.
@@ -103,8 +103,9 @@ data structures in memory or on disk respectively.
103
103
104
104
ETS lets you create a table containing tuples. By default, ETS tables
105
105
are protected, which means only the owner process may write to the table
106
- but any other process can read. ETS has some functionality to be used as
107
- a simple database, a key-value store or as a cache mechanism.
106
+ but any other process can read. ETS has some functionality to allow a
107
+ table to be used as a simple database, a key-value store or as a cache
108
+ mechanism.
108
109
109
110
The functions in the ` ets ` module will modify the state of the table as a
110
111
side-effect.
You can’t perform that action at this time.
0 commit comments