func (g *Graph) Objects() []*Object {
	objects := make([]*Object, 0, len(g.unnamed)+len(g.named))
	for _, o := range g.unnamed {
		if !o.embedded {
			objects = append(objects, o)
		}
	}
	for _, o := range g.named {
		if !o.embedded {
			objects = append(objects, o)
		}
	}
	// randomize to prevent callers from relying on ordering
	for i := 0; i < len(objects); i++ {
		j := rand.Intn(i + 1)
		objects[i], objects[j] = objects[j], objects[i]
	}
	return objects
}
func (g *Graph) Objects() []*Object {
	objects := make([]*Object, 0, len(g.unnamed)+len(g.named))
	for _, o := range g.unnamed {
		if !o.embedded {
			objects = append(objects, o)
		}
	}
	for _, o := range g.named {
		if !o.embedded {
			objects = append(objects, o)
		}
	}
	
	for i := 0; i < len(objects); i++ {
		j := rand.Intn(i + 1)
		objects[i], objects[j] = objects[j], objects[i]
	}
	return objects
}
func ( g * Graph ) Objects ( ) [ ] * Object { objects := make ( [ ] * Object , 0 , len ( g . unnamed ) + len ( g . named ) ) for _ , o := range g . unnamed { if ! o . embedded { objects = append ( objects , o ) } } for _ , o := range g . named { if ! o . embedded { objects = append ( objects , o ) } } // randomize to prevent callers from relying on ordering for i := 0 ; i < len ( objects ) ; i ++ { j := rand . Intn ( i + 1 ) objects [ i ] , objects [ j ] = objects [ j ] , objects [ i ] } return objects }
// Objects returns all known objects, named as well as unnamed. The returned
// elements are not in a stable order.
Objects returns all known objects named as well as unnamed . The returned elements are not in a stable order .