Returns all Nodes and Edges of this Graph as list.
@access		public
@return		array
761044
public function toList()
	{
		$list = array();
		$nodes = $this->getNodes();
		foreach( $nodes as $source )
		{
			$sublist = array();
			foreach( $nodes as $target )
			{
				if( $this->isEdge( $source, $target ) )
					$sublist[$target->getNodeName()] = $this->getEdgeValue( $source, $target );
			}
			$list [$source->getNodeName()] = $sublist;
		}
		return $list;
	}
691781
public function toArray(){
		$array	= array();
		foreach( $this->data as $key => $node ){
			if( count( $node->data ) )
				$array[$key]	= $node->toArray();
			else
				$array[$key]	= $node->value;
		}
		return $array;
	}
1120501
public function all() {
  $query = new \Peyote\Select($this->db_table());
  $query->columns('name');
  $result = $this->db->fetch($query);
  foreach($result as $r) {
   $list[] = $r['name'];
  }
  return $list;
 }
626953
public function getList()
    {
        $data = [];
        foreach ($this->providers as $provider) {
            /** @var ProviderInterface $provider */
            $data = array_merge_recursive(
                $data, $provider->getImages()
            );
        }

        return $data;
    }
154247
public function getNodes()
    {
        $nodes = [];
        $data = $this->getState();

        foreach ($data['nodes'] as $id => $name) {
            $nodes[] = new Node($id, $this->getClient());
        }

        return $nodes;
    }
488413
public function getList()
    {
        $url = self::GET_LIST_URL.$this->access_token;
        $data = $this->curl->get($url);

        return $data;
    }
315659
public function getColorVertices()
    {
        $colors = $this->getColors();
        $ret = array(0 => array(), 1 => array());

        foreach ($this->graph->getVertices()->getMap() as $vid => $vertex) {
            $ret[$colors[$vid]][$vid] = $vertex;
        }

        return $ret;
    }
224425
public function getNodeNames()
    {
        $data = $this->getState();
        $nodeNames = [];
        foreach ($data['nodes'] as $node) {
            $nodeNames[] = $node['name'];
        }

        return $nodeNames;
    }
144871
def get_edges(self):
        """"""
        edge_from_to = []
        for parent, children in self.p_from_cs.items():
            for child in children:
                edge_from_to.append((child, parent))
        for parent, children in self.c_from_ps.items():
            for child in children:
                edge_from_to.append((child, parent))
        return edge_from_to
953366
public function getNodes()
    {
        if (is_null($this->_nodes)) {
            $this->_nodes = new FileSystemList(
                $this->details->getRealPath()
            );
        }
        return $this->_nodes;
    }
1194773
def get_edge_list(self):
        
        edge_objs = list()

        for obj_dict_list in self.obj_dict['edges'].values():
            edge_objs.extend([
                Edge(obj_dict=obj_d)
                for obj_d
                in obj_dict_list])

        return edge_objs
1138628
public function getChildren()
    {
        $nodes = [];
        $iterator = new \FilesystemIterator(
            $this->path,
            \FilesystemIterator::CURRENT_AS_SELF
          | \FilesystemIterator::SKIP_DOTS
        );

        foreach ($iterator as $entry) {
            $nodes[] = $this->getChild($entry->getFilename());
        }

        return $nodes;
    }
393063
public function rootNodes()
    {
        $query = $this->model->newQuery()->whereNull($this->parentIdKey);

        $this->callBeforeListeners('rootNodes', [$query]);

        $nodes = $query->get()->all();

        $this->callAfterListeners('rootNodes', [$nodes]);

        return $nodes;
    }
834575
public function getEdgesOut()
    {
        $that = $this;

        return $this->getEdges()->getEdgesMatch(function (Edge $edge) use ($that) {
            return $edge->hasVertexStart($that);
        });
    }
528478
public function getCallGraph()
    {
        $node = $root = new Node(array());
        foreach ($this->getQueries() as $query) {
            foreach (array_reverse($query['trace']) as $trace) {
                $node = $node->push($trace);
            }
            $node->addValue($query);
            $node = $root;
        }

        return $root;
    }
782978
public function getInDegree()
    {

        if (!is_a($this->nodeGraph, "\Platform\Graph")):
            throw new \Exception("Unkown node parent graph. Cannot calculate InDegree of NODE:" . $this->getId(), PLATFORM_ERROR); //Unkonwn graph type;
        endif;

        $graph = $this->getGraph();
        $arcIds = $graph->getArcSet();

        //If this graph is undirected, then we can't calculate the  indegree to this node;
        if (empty($arcIds))
            return $this->getDegree();

        $edges = $graph->getEdgeSet();
        $incidence = 0;

        //search for all arcs with this node as tail
        foreach ($arcIds as $arc):
            $edge = $edges[$arc];
            if ($edge->getTail()->getId() == $this->getId()) {
                $incidence++;
                //if head is the same as self, as is the case in cycled edges then we have one more indegree,
                //looped vertices have an indegree of two;
                if ($edge->getHead()->getId() == $this->getId())
                    $incidence++;
            }
        endforeach;

        return $incidence;
    }
1150367
function nodes(){
    var nodeSet = {};
    Object.keys(edges).forEach(function (u){
      nodeSet[u] = true;
      edges[u].forEach(function (v){
        nodeSet[v] = true;
      });
    });
    return Object.keys(nodeSet);
  }