@@ -2,7 +2,6 @@ package graph

 import (

 	"fmt"

-	"io"

 	"sort"

 	"strings"

@@ -142,7 +141,8 @@ func New() Graph {

 	}

 }

-// Edges returns all the edges of the graph

+// Edges returns all the edges of the graph. Note that the returned set

+// will have no specific ordering.

 func (g Graph) Edges() []graph.Edge {

 	return g.internal.Edges()

 }

@@ -643,14 +643,3 @@ func pathEqual(a, b []graph.Node) bool {

 	}

 	return true

 }

-

-func Fprint(out io.Writer, g Graph) {

-	for _, node := range g.Nodes() {

-		fmt.Fprintf(out, "node %d %s\n", node.ID(), node)

-	}

-	for _, edge := range g.Edges() {

-		for _, edgeKind := range g.EdgeKinds(edge).List() {

-			fmt.Fprintf(out, "edge %d -> %d : %s\n", edge.From().ID(), edge.From().ID(), edgeKind)

-		}

-	}

-}