Gtjkyu

XML from URL into historical data graph What I'm after is a service or script that pulls XML from a URL once every x minutes, saves the data to a mysql database and then users are able to search for an item and it displays historical price data for that item. This is what the XML looks like for 1 item: <?xml version="1.0" encoding="UTF-8"?> <Success> <Result> <AccId>2075</AccId> <Type>2793</Type> <Price>100</Price> <SaleId>211557</SaleId> <Time>636662891054273275</Time> <Hours>47</Hours> </Result> <Result> <AccId>7911</AccId> <Type>2793</Type> <Price>100</Price> <SaleId>198528</SaleId> <Time>636662291658957640</Time> <Hours>31</Hours> </Result> <Result> <AccId>8839</AccId> ...

A-star algorithm for Graph Matching [closed] I am developing an application to mark block diagrams using neo4j together with graph matching. I am marking the diagrams by comparing the teacher's answer graph with the student's answer graph, and I am using graph matching for this. Currently I have implemented detecting of additions, deletions, and substitutions of nodes using Depth-first search in my own way, but I want to understand the other currently existing algorithms, and also know if they are better. Many research papers have mentioned A-star algorithm for graph matching. I find it difficult to understand the pseudo codes in the research papers. I was mostly able to understand what they have described, which is not alot, but I want to understand completely. I would be grateful if someone could explain me how the A-star algorithm for graph matching works, or provide me a link with a better explanation about this algorithm used for error-tolerant graph matching using graph ...

Excel using a string as a cell reference I am trying to create a dynamic graph that checks which financial year it is and then only graph the data for that range of months. I have a 'SUMMARY DATA' sheet that has rows with the date range 1/7/18 || 31/7/18 and so on for every month. I am trying to create a dynamic range that takes these values and then have the graph use those cell references. Currently I am using a fancy concatenate function that gives me 'SUMMARY DATA'!$H$25:$H$36 (In cell DASHBOARD!$AJ$24 ) which is the range that I want to reference. I can't seem to get this working with a graph though. If I place =DASHBOARD!$AJ$24 as the series values, the graph doesn't update with the correct values (just 0 for every column). If I try using =INDIRECT(DASHBOARD!$AJ$24) , it gives me a "That function isn't valid" error. 'SUMMARY DATA'!$H$25:$H$36 DASHBOARD!$AJ$24 =DASHBOARD!$AJ$24 =INDIRECT(DASHBOARD!$AJ$24) Not sure how to progress ...

Constrained shortest distance in a graph I came across this problem at a coding site and I have no idea on how to solve it. The editorial is not available nor was I able to find any related article online. So I am asking this here. You have a graph G that contains N vertices and M edges. The vertices are numbered from 1 through N. Also each node is colored either Black or White. You want to calculate the shortest path from 1 to N such that the difference of black and white nodes is at most 1. As obvious as it is, applying straight forward Dijkstra's Algorithm will not work. Any help is appreciated. Thank you! One solution: Naive approach. Compute all paths, filter and then take the shortest. Note that you need to account for loops, they could pump up one color to reduce the difference. – Zabuza Jul 1 at 17:47 ...