The options for EntryMode are 'auto'(the default), 'neighbors' and 'edges'. If 'edges' is selected, then the input should contain a list of lists and the inner lists correspond to pairs of vertices incident to a given edge. If 'neighbors' is selected, then the input should contain a list of lists and in the inner lists, the 0th entry is a vertex and the 1st entry is the list of its neighbors. The default 'auto' option distinguished between the other two options automatically.
i1 : graph ({{a,{b,c,d,e}}, {b,{d,e}}, {e,{a}}},EntryMode=>"neighbors") o1 = Graph{a => {e, b, c, d}} b => {e, a, d} c => {a} d => {a, b} e => {a, b} o1 : Graph |
i2 : graph ({{a,{b,c,d,e}}, {b,{d,e}}, {e,{a}}},EntryMode=>"auto") o2 = Graph{a => {e, b, c, d}} b => {e, a, d} c => {a} d => {a, b} e => {a, b} o2 : Graph |
i3 : graph ({{a,b}, {b,d}, {c,d},EntryMode=>"edges"}) o3 = Graph{a => {b} } b => {a, d} c => {d} d => {b, c} edges => {EntryMode} EntryMode => {edges} o3 : Graph |
i4 : graph ({{a,b}, {b,d}, {c,d},EntryMode=>"auto"}) o4 = Graph{a => {b} } auto => {EntryMode} b => {a, d} c => {d} d => {b, c} EntryMode => {auto} o4 : Graph |