Graph (discrete mathematics): Revision history

Template:FlatlistExternal tools:

Template:Endflatlist


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. Template:Nowrap from current version, Template:Nowrap from preceding version, Template:Nowrap, Template:Nowrap, Template:Nowrap

15 May 2025

  • curprev 04:3004:30, 15 May 2025imported>David Eppstein 28,720 bytes +28,720 Undid revision 1290491005 by Manitofigh (talk) ordered and unordered pairs are a way of representing edges with directions. They are not the only way. For instance, representing a graph as a set of pairs works very badly for mixed graphs and multigraphs and is somewhat cumbersome for graph orientations. for We should keep representation details separate from the basic idea of a graph.